Paper
22 March 1996 Constructing the convex hull of a planar density-bounded integral-points set in linear time
Junhui Deng, Zesheng Tang, Meihe Xu
Author Affiliations +
Proceedings Volume 2644, Fourth International Conference on Computer-Aided Design and Computer Graphics; (1996) https://doi.org/10.1117/12.235538
Event: Fourth International Conference on Computer-Aided Design and Computer Graphics, 1995, Wuhan, China
Abstract
A special kind of points sets named DPDIS is defined in this paper, followed by an elegant algorithm for constructing the convex hull of this class of points sets. Taking advantages of the characteristics of this sets category, this algorithm finishes its work within an O(N) complexity. The crux of this algorithm is a new sorting method by which all points can be sorted along x direction in linear time.
© (1996) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Junhui Deng, Zesheng Tang, and Meihe Xu "Constructing the convex hull of a planar density-bounded integral-points set in linear time", Proc. SPIE 2644, Fourth International Conference on Computer-Aided Design and Computer Graphics, (22 March 1996); https://doi.org/10.1117/12.235538
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Neodymium

Associative arrays

Computer science

Fourier transforms

Tin

Back to Top