Sciweavers

52 search results - page 5 / 11
» Triangulations Intersect Nicely
Sort
View
DM
2010
127views more  DM 2010»
14 years 11 months ago
Enumeration and limit laws of dissections on a cylinder
We compute the generating function for triangulations on a cylinder, with the restriction that all vertices belong to its boundary and that the intersection of a pair of different ...
Juanjo Rué
SGP
2003
15 years 1 months ago
Edge-Sharpener: Recovering Sharp Features in Triangulations of non-adaptively re-meshed surfaces
3D scanners, iso-surface extraction procedures, and several recent geometric compression schemes sample surfaces of 3D shapes in a regular fashion, without any attempt to align th...
Marco Attene, Bianca Falcidieno, Michela Spagnuolo...
CAIP
2007
Springer
170views Image Analysis» more  CAIP 2007»
15 years 3 months ago
Image Segmentation Using Topological Persistence
Abstract. This paper presents a new hybrid split-and-merge image segmentation method based on computational geometry and topology using persistent homology. The algorithm uses edge...
David Letscher, Jason Fritts
COMPGEOM
2005
ACM
15 years 1 months ago
Learning smooth objects by probing
We consider the problem of discovering a smooth unknown surface S bounding an object O in R3 . The discovery process consists of moving a point probing device in the free space ar...
Jean-Daniel Boissonnat, Leonidas J. Guibas, Steve ...
CAD
2005
Springer
14 years 11 months ago
A Delaunay-based region-growing approach to surface reconstruction from unorganized points
This paper presents a Delaunay-based region-growing (DBRG) surface reconstruction algorithm that holds the advantages of both Delaunay-based and region-growing approaches. The pro...
Chuan-Chu Kuo, Hong-Tzong Yau