230 search results - page 35 / 46 » The distance trisector curve |
SMA
2003
ACM
14 years 4 months ago
2003
ACM
We present an efficient algorithm to approximate the swept volume (SV) of a complex polyhedron along a given trajectory. Given the boundary description of the polyhedron and a pat...
VISUALIZATION
2002
IEEE
14 years 3 months ago
2002
IEEE
We present a robust, noise-resistant criterion characterizing planelike skeletons in binary voxel objects. It is based on a distance map and the geodesic distance along the object...
CGF
2007
13 years 11 months ago
2007
We propose a mesh segmentation algorithm via recursive bisection where at each step, a sub-mesh embedded in 3D is first spectrally projected into the plane and then a contour is ...
CVPR
2008
IEEE
15 years 27 days ago
2008
IEEE
The geometric median is a classic robust estimator of centrality for data in Euclidean spaces. In this paper we formulate the geometric median of data on a Riemannian manifold as ...
ECCV
2004
Springer
15 years 23 days ago
2004
Springer
Level-set methods have been shown to be an effective way to solve optimisation problems that involve closed curves. They are well known for their capacity to deal with flexible top...