102291 search results - page 182 / 20459 » Computability in Computational Geometry |
144
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...
186
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...
174
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...
158
click to vote
CISST
2003
15 years 7 months ago
2003
We present a new method to compress triangle meshes in a lossless manner. Triangle compression requires compression of the geometry (vertices) as well as the topology (connectivit...
171
click to vote
CGF
2006
15 years 6 months ago
2006
Surface representation and processing is one of the key topics in computer graphics and geometric modeling, since it greatly affects the range of possible applications. In this pa...