Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer-journals/on-computing-the-convex-hull-of-piecewise-curved-objects-9X3nLSLej3
References (28)
-
Franck Nielsen, M. Yvinec (1995)
An Output-Sensitive Convex Hull Algorithm for Planar Objects -
Jerry Prince, A. Willsky (1990)
Reconstructing Convex Sets from Support Line MeasurementsIEEE Trans. Pattern Anal. Mach. Intell., 12
-
C. Yap (1987)
AnO(n logn) algorithm for the voronoi diagram of a set of simple curve segmentsDiscrete & Computational Geometry, 2
-
A. Schäffer, C. Wyk (1987)
Convex Hulls of Piecewise-Smooth Jordan CurvesJ. Algorithms, 8
-
R. Graham (1972)
An Efficient Algorithm for Determining the Convex Hull of a Finite Planar SetInf. Process. Lett., 1
-
J. Boissonnat, A. Cérézo, O. Devillers, J. Duquesne, M. Yvinec (1996)
An Algorithm for Constructing the Convex Hull of a Set of Spheres in Dimension DComput. Geom., 6
-
M. Sharir, P. Agarwal (1995)
Davenport-Schinzel sequences and their geometric applications -
F. Aurenhammer (1987)
Power Diagrams: Properties, Algorithms and ApplicationsSIAM J. Comput., 16
-
Y. Yue, J. Murray, J. Corney, D. Clark (1999)
Convex hull of a planar set of straight and circular line segmentsEngineering Computations, 16
-
H. Alt, O. Cheong (1995)
The Voronoi Diagram of Curved ObjectsDiscrete & Computational Geometry, 34
-
L. Piegl, W. Tiller (2002)
Biarc approximation of NURBS curvesComput. Aided Des., 34
-
D. Dobkin, D. Souvaine (1990)
Computational geometry in a curved worldAlgorithmica, 5
-
D. Rappaport (1991)
A Convex Hull Algorithm for Discs, and ApplicationsComput. Geom., 1
-
Z. Li, D.S. Meek (2005)
Smoothing an arc spline.Comput. Graph., 29
-
Zhong Li, D. Meek (2005)
Technical section: Smoothing an arc splineComputers & Graphics, 29
-
J. Boissonnat, C. Delage (2005)
Convex Hull and Voronoi Diagram of Additively Weighted Points -
P. Ghosh, K. Kumar (1998)
Support Function Representation of Convex Bodies, Its Application in Geometric Computing, and Some Related RepresentationsComput. Vis. Image Underst., 72
-
J. Boissonnat, M. Karavelas (2003)
On the combinatorial complexity of euclidean Voronoi cells and convex hulls of d-dimensional spheres -
D. Kirkpatrick, R. Seidel (1986)
The Ultimate Planar Convex Hull Algorithm?SIAM J. Comput., 15
-
P. Gruber, J. Wills (1993)
Handbook of Convex Geometry -
Supriya Biswas, D. Prasad, S. Pal (1992)
Recognizing weakly convex visible polygonsComput. Geom., 10
-
O. Aichholzer, F. Aurenhammer, T. Hackl, B. Jüttler, Margot Rabl, Z. Sír (2007)
Computational and Structural Advantages of Circular Boundary RepresentationInt. J. Comput. Geom. Appl., 21
-
O. Aichholzer, H. Alt, G. Rote (1994)
Matching shapes with a reference pointInt. J. Comput. Geom. Appl., 7
-
A. Melkman (1987)
On-Line Construction of the Convex Hull of a Simple PolylineInf. Process. Lett., 25
-
T. Richardson (1997)
Approximation of Planar Convex Sets from Hyperplane ProbesDiscrete & Computational Geometry, 18
-
Austria e-mail: [email protected] -
C. Bajaj, Myung-Soo Kim (1991)
Convex hulls of objects bounded by algebraic curvesAlgorithmica, 6
-
R. Jarvis (1973)
On the Identification of the Convex Hull of a Finite Set of Points in the PlaneInf. Process. Lett., 2
- Publisher
- Springer Journals
- Copyright
- Copyright © 2012 by Springer Basel AG
- Subject
- Mathematics; Computer Science, general; Mathematics, general
- ISSN
- 1661-8270
- eISSN
- 1661-8289
- DOI
- 10.1007/s11786-012-0111-z
- Publisher site
- See Article on Publisher Site
Abstract
We utilize support functions to transform the problem of constructing the convex hull of a finite set of curved objects into the problem of computing the upper envelope of piecewise linear functions. This approach is particularly suited if the objects are (possibly intersecting) circular arcs in the plane.
Journal
Mathematics in Computer Science – Springer Journals
Published: May 11, 2012