3025 search results - page 169 / 605 » Computational geometry: a retrospective |
147
click to vote
DGCI
2009
Springer
16 years 1 months ago
2009
Springer
In this report, we propose a new definition of the E2 DT (Squared Euclidean Distance Transformation) on irregular isothetic grids. We describe a new separable algorithm to compute...
181
click to vote
COMPGEOM
2003
ACM
15 years 11 months ago
2003
ACM
We define the Morse-Smale complex of a Morse function over a 3-manifold as the overlay of the descending and ascending manifolds of all critical points. In the generic case, its ...
157
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
We prove that the union complexity of a set of n constantcomplexity locally fat objects (which can be curved and/or non-convex) in the plane is O(λt+2(n) log n), where t is the m...
140
click to vote
DGCI
2000
Springer
15 years 11 months ago
2000
Springer
The paper presents a new method of investigating topological properties of three-dimensional manifolds by means of computers. Manifolds are represented as finite cell complexes. Th...
161
click to vote
COMPGEOM
1996
ACM
15 years 10 months ago
1996
ACM
This paper addresses the complexity of computing the smallest-radius infinite cylinder that encloses an input set of n points in 3-space. We show that the problem can be solved in...