3005 search results - page 173 / 601 » Computational geometry for sculpture |
205
click to vote
COMPGEOM
1991
ACM
15 years 10 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...
178
click to vote
COMPGEOM
2005
ACM
15 years 8 months 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...
164
click to vote
COMPGEOM
2005
ACM
15 years 8 months ago
2005
ACM
Let S be an ordered set of disjoint unit spheres in R3 . We show that if every subset of at most six spheres from S admits a line transversal respecting the ordering, then the ent...
204
click to vote
COMPGEOM
2005
ACM
15 years 8 months ago
2005
ACM
We present a near linear time algorithm for constructing hierarchical nets in finite metric spaces with constant doubling dimension. This data-structure is then applied to obtain...
191
click to vote
DGCI
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We present in this paper robust geometric feature estimators on the border of a possibly noisy discrete object. We introduce the notion of patch centered at a point of th...