Sciweavers

21 search results - page 2 / 5
» Voronoi diagram computations for planar NURBS curves
Sort
View
IJCGA
2008
179views more  IJCGA 2008»
13 years 7 months ago
Computing the Hausdorff Distance between Curved Objects
The Hausdorff distance between two sets of curves is a measure for the similarity of these objects and therefore an interesting feature in shape recognition. If the curves are alg...
Helmut Alt, Ludmila Scharf
CG
2005
Springer
13 years 7 months ago
Smoothing an arc spline
Arc splines are G1 continuous curves made of circular arcs and straight-line segments. They have the advantages that the curvature of an arc spline is known and controlled at all ...
Zhong Li, Dereck S. Meek
CCCG
2006
13 years 9 months ago
An O(n log n) Algorithm for the All-Farthest-Segments Problem for a Planar Set of Points
In this paper, we propose an algorithm for computing the farthest-segment Voronoi diagram for the edges of a convex polygon and apply this to obtain an O(n log n) algorithm for th...
Asish Mukhopadhyay, Robert L. Scot Drysdale
CGF
2008
113views more  CGF 2008»
13 years 7 months ago
Surface sampling and the intrinsic Voronoi diagram
We develop adaptive sampling criteria which guarantee a topologically faithful mesh and demonstrate an improvement and simplification over earlier results, albeit restricted to 2D...
Ramsay Dyer, Hao Zhang 0002, Torsten Möller
SI3D
1999
ACM
13 years 11 months ago
Interactive curve design using digital French curves
In the real world designers often use French curves or sweeps to create or edit curves to bring out a personal style or reflect a corporate standard in all their designs. A Frenc...
Karan Singh