947 search results - page 124 / 190 » Discrete Geometry |
134
click to vote
COMPGEOM
2004
ACM
15 years 10 months ago
2004
ACM
The Reeb graph is a useful tool in visualizing real-valued data obtained from computational simulations of physical processes. We characterize the evolution of the Reeb graph of a...
120
click to vote
COMPGEOM
2003
ACM
15 years 10 months ago
2003
ACM
We present an algorithm to reconstruct a collection of disjoint smooth closed curves from noisy samples. Our noise model assumes that the samples are obtained by first drawing po...
133
click to vote
COMPGEOM
2003
ACM
15 years 10 months ago
2003
ACM
Given a set H of n hyperplanes in IRd , we present an algorithm that ε-approximates the extent between the top and bottom k levels of the arrangement of H in time O(n+(k/ε)c), w...
139
click to vote
COMPGEOM
2003
ACM
15 years 10 months ago
2003
ACM
Given a polygonal curve and a geometric graph, we describe an efficient algorithm to find a path in the graph which is most similar to the curve, using the well-known Fr´echet d...
142
click to vote
DGCI
2003
Springer
15 years 10 months ago
2003
Springer
This paper describes a method to accelerate the generation of shape primitives for N-dimensional images N X . These shape primitives can be used in conditions for topology preservi...