2980 search results - page 165 / 596 » Computational Geometry |
DGCI
2009
Springer
15 years 4 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...
DGCI
2000
Springer
15 years 2 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...
86
Voted
COMPGEOM
1996
ACM
15 years 2 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...
COMPGEOM
1991
ACM
15 years 1 months ago
1991
ACM
Given a simple polygon in the plane with two distinguished vertices, s and g, is it possible for two guards to simultaneously walk along the two boundary chains from s to g in suc...
COMPGEOM
2005
ACM
15 years 8 days ago
2005
ACM
We initiate the study of exact geometric algorithms that require limited storage and make only a small number of passes over the input. Fundamental problems such as lowdimensional...