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

Elisabeth Le Bras-Mehlman

dblp:86/10794 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 1990
—ORCID · none

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

Artificial intelligence and machine learning · 3 · 1 first-authorSystems, architecture and hardware · 1Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author

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.

Artificial intelligence
2 papers
3D vision · 100%
Computer graphics and multimedia
2 papers
Geometric modeling and processing · 100%

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

TopicWeightPapersLastEvidence papers
Geometric modeling and processing › mesh generation
delaunay triangulation
0.021990
Representing Stereo Data with the Delaunay Triangulation · Artif. Intell. 1990
How the Delaunay Triangulation Can Be used For Representing Stereo Data · ICCV 1988
Computer vision › 3D vision
3d reconstruction
0.011988
Representing stereo data with the Delaunay triangulation · ICRA 1988
Computer vision › 3D vision › 3d reconstruction › multi-view stereo
stereo reconstruction
0.011988
How the Delaunay Triangulation Can Be used For Representing Stereo Data · ICCV 1988
Computer vision › 3D vision › 3d reconstruction
surface reconstruction
0.011988
Representing stereo data with the Delaunay triangulation · ICRA 1988
Computer vision › 3D vision › 3d shape representation
surface representation
0.011988
How the Delaunay Triangulation Can Be used For Representing Stereo Data · ICCV 1988
Computer vision › 3D vision
stereo vision
0.011988
Representing stereo data with the Delaunay triangulation · ICRA 1988

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

visibility criterion · 0.0mathematical morphology · 0.0delaunay triangulation · 0.0probabilistic geometry · 0.0constrained delaunay triangulation · 0.0
YearPublicationVenuePosition
1990 Representing Stereo Data with the Delaunay Triangulation
Olivier D. Faugeras, Elisabeth Le Bras-Mehlman, Jean-Daniel Boissonnat
Artif. Intell.2
1988 How the Delaunay Triangulation Can Be used For Representing Stereo Data
abstract
This article proposes a coherent method of interpolating 3D data obtained for example by stereo, with a polyhedral surface by means of the Delaunay Triangulation. We first give some theoretical properties concerning the approximations of sampled objects we obtain when the sampling rate increases, based on the study of their skeleton using some tools of Mathematical Morphology. Then, we present the algorithms and their complexity analysis which yield both a surface representation of objects and a volume representation of free space which may be useful in Robotics. This goal is achieved by means of a simple visibility criterion. The method is intrinsically discontinuity preserving and can be used for the integration of multiple viewpoints.
Elisabeth Le Bras-Mehlman, Michel Schmitt, Olivier D. Faugeras, Jean-Daniel Boissonnat
ICCV1
1988 Representing stereo data with the Delaunay triangulation
abstract
A coherent way of interpolating 3-D data obtained by stereo, for example, with a simplicial polyhedral surface is discussed. The method is based on constrained Delaunay triangulation; the polyhedral surface is obtained by using a simple visibility property to mark tetrahedra likely to be empty. The method is intrinsically discontinuity-preserving and yields both a surface representation of objects and a volume representation of free space which may be useful in robotics. Algorithms to implement the method are described and their complexity analyzed in the worst case and average case situations where tools of probabilistic geometry are used.>
Jean-Daniel Boissonnat, Olivier D. Faugeras, Elisabeth Le Bras-Mehlman
ICRA3