Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 7-Day Trial for You or Your Team.

Learn More →

DeepDyve requires Javascript to function. Please enable Javascript on your browser to continue.

Convex hull of a planar set of straight and circular line segments

Yong Yue; J.L. Murray; J.R. Corney; D.E.R. Clark

Engineering Computations: International Journal for Computer-Aided Engineering and Software , Volume 16 (8): 18 – Dec 1, 1999

Read Article

Download PDF

Share Full Text for Free

18 pages

Loading next page...

References (27)

C. Wyk, J. O'Rourke (1995)
Computational Geometry in C.
Mathematics of Computation, 64
S. Chuang, C. Pan (1998)
Rough cut tool path planning for B-spline surfaces using convex hull boxes
The International Journal of Advanced Manufacturing Technology, 14
J. Hershberger, S. Suri (1990)
Applications of a semi-dynamic convex hull algorithm
BIT Numerical Mathematics, 32
R.A. Jarvis
On the identification of the convex hull of a finite set in the plane
C. Yap (1987)
AnO(n logn) algorithm for the voronoi diagram of a set of simple curve segments
Discrete & Computational Geometry, 2
A. Schäffer, C. Wyk (1987)
Convex Hulls of Piecewise-Smooth Jordan Curves
J. Algorithms, 8
Sung-yong Shin, T. Woo (1986)
Finding the convex hull of a simple polygon in linear time
Pattern Recognit., 19
R. Graham (1972)
An Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set
Inf. Process. Lett., 1
H. Bez, J. Edwards (1990)
Distributed algorithm for the planar convex hull problem
Comput. Aided Des., 22
W. Eddy (1977)
A New Convex Hull Algorithm for Planar Sets
ACM Trans. Math. Softw., 3
F. Preparata, M. Shamos (1985)
Computational geometry: an introduction
Mathematics of Computation, 47
Y. Kim (1992)
Recognition of form features using convex decomposition
Comput. Aided Des., 24
T. Kao, G. Knott (1990)
An efficient and numerically correct algorithm for the 2D convex hull problem
BIT, 30
D. Chand, S. Kapur (1970)
An Algorithm for Convex Polytopes
J. ACM, 17
Lin-Lin Chen, S. Chou, T. Woo (1993)
Separating and intersecting spherical polygons: computing machinability on three-, four-, and five-axis numerically controlled machines
ACM Trans. Graph., 12
C. Bajaj, M.‐S. Kim
Convex hulls of objects bounded by algebraic curves
F. Preparata (1979)
An optimal real-time algorithm for planar convex hulls
Commun. ACM, 22
J. Ferreira, Srichand Hinduja (1990)
Convex hull-based feature-recognition method for 2.5D components
Comput. Aided Des., 22
A. Rosenfeld (1969)
Picture Processing by Computer
ACM Comput. Surv., 1
A. Day (1991)
Parallel implementation of 3D convex-hull algorithm
Comput. Aided Des., 23
Moon-Kyu Lee (1997)
A new convex-hull based approach to evaluating flatness tolerance
Comput. Aided Des., 29
J. Corney, D.E.R. Clark, J.L. Murray, Y. Yue
Automatic classification of single‐ and double‐sided 2.5D components
H. Freeman, R. Shapira (1975)
Determining the minimum-area encasing rectangle for an arbitrary closed curve
Commun. ACM, 18
K. Sugihara (1994)
Robust Gift Wrapping for the Three-Dimensional Convex Hull
J. Comput. Syst. Sci., 49
J. Murray, Y. Yue (1993)
Automatic machining of 2·5D components with the ACIS modeller
International Journal of Computer Integrated Manufacturing, 6
L.L. Chen, S.Y. Chou, T.C. Woo
Separating and intersecting spherical polygons – computing machinability on 3‐axis, 4‐axis and 5‐axis numerically controlled machines
R. Jarvis (1973)
On the Identification of the Convex Hull of a Finite Set of Points in the Plane
Inf. Process. Lett., 2

Publisher: Emerald Publishing
Copyright: Copyright © 1999 MCB UP Ltd. All rights reserved.
ISSN: 0264-4401
DOI: 10.1108/02644409910304086
Publisher site: See Article on Publisher Site

There are no references for this article.