947 search results - page 144 / 190 » Discrete Geometry |
COMPGEOM
2004
ACM
15 years 3 months ago
2004
ACM
The computation of Delaunay triangulations from static point sets has been extensively studied in computational geometry. When the points move with known trajectories, kinetic dat...
COMPGEOM
2004
ACM
15 years 3 months ago
2004
ACM
We propose a strategy to decompose a polygon, containing zero or more holes, into “approximately convex” pieces. For many applications, the approximately convex components of ...
COMPGEOM
2010
ACM
15 years 2 months ago
2010
ACM
We consider the problem of reconstructing a compact 3manifold (with boundary) embedded in R3 from its crosssections with a given set of cutting planes having arbitrary orientation...
COMPGEOM
2009
ACM
15 years 2 months ago
2009
ACM
We demonstrate how the scale axis transform can be used to compute a parameterized family of shape skeletons. The skeletons gradually represent only the most important features of...
DGCI
2005
Springer
15 years 3 months ago
2005
Springer
The watershed transformation is an efficient tool for segmenting grayscale images. An original approach to the watershed [1,9] consists in modifying the original image by lowering...