Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

Alain Croteau

dblp:144/5126 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1992
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1Systems, architecture and hardware · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer graphics and multimedia
1 paper
Geometric modeling and processing · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Geometric modeling and processing › point cloud processing
range image processing		 0.011992
A multi-resolution surface model for compact representation of range images · ICRA 1992
Geometric modeling and processing
surface fitting		 0.011992
A multi-resolution surface model for compact representation of range images · ICRA 1992
Geometric modeling and processing
surface reconstruction		 0.011992
A multi-resolution surface model for compact representation of range images · ICRA 1992

Methods — techniques the papers use, named apart from their topics

local retriangulation error minimization · 0.0greedy point removal · 0.0
YearPublicationVenuePosition
1992 A multi-resolution surface model for compact representation of range images
abstract
The authors present a surface triangulation technique for surface description at different levels of resolution in a range image. A step discontinuity constrained 2-1/2-D triangulation of all points is first computed. A sequential optimization process then removes, at each iteration. the point that minimizes the local retriangulation approximation error caused by its removal. The iterative process can stop at any time to obtain a desired level of approximation error.>
Marc Soucy, Alain Croteau, Denis Laurendeau
 ICRA2