2093 search results - page 115 / 419 » Statistical Point Geometry |
116
click to vote
IMR
2005
Springer
15 years 9 months ago
2005
Springer
This paper describes a method for extracting feature edges of a polygonal surface for mesh generation. This method can extract feature edges from a polygonal surface typically cre...
182
Voted
COMPGEOM
2010
ACM
15 years 8 months ago
2010
ACM
The Reeb graph of a scalar function represents the evolution of the topology of its level sets. In this video, we describe a near-optimal output-sensitive algorithm for computing ...
147
Voted
COMPGEOM
2000
ACM
15 years 7 months ago
2000
ACM
The algorithms for computing a shortest path on a polyhedral surface are slow, complicated, and numerically unstable. We have developed and implemented a robust and efficient algo...
146
click to vote
COMPGEOM
2000
ACM
15 years 7 months ago
2000
ACM
We present an (1+ε)-approximation algorithm for computing the minimum-spanning tree of points in a planar arrangement of lines, where the metric is the number of crossings betwee...
113
Voted
COMPGEOM
2007
ACM
15 years 7 months ago
2007
ACM
We consider the problem of approximating a set P of n points in Rd by a collection of j-dimensional flats, and extensions thereof, under the standard median / mean / center measur...