An Efficient Approach of Convex Hull Triangulation Based on Monotonic Chain

Yu Ping Zhang; Zhao Ri Deng; Rui Qi Zhang

doi:10.4028/www.scientific.net/AMM.263-266.1605

Paper Titles

An Administration Iteration Problem and its Solution when Deploying the RBAC Model
p.1584

An Analysis Method of Semantic Relevancy on Controlled Tag
p.1588

An Approach to Detect Similar Script Functions in Web Applications Based on Calling Information
p.1593

An Audit-Integrated ARBAC Model
p.1600

An Efficient Approach of Convex Hull Triangulation Based on Monotonic Chain
p.1605

An Improved Ant Colony Optimization for VRP with Time Windows
p.1609

An Improved Three-Dimensional Target Octonion Representation
p.1614

Construction and Application of WD-GA-SVR Model - CSI 300 Index Forecast
p.1619

Design and Implementation of ARM-Based Mobile Handheld Terminal for Community Medical
p.1623

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 263-266An Efficient Approach of Convex Hull Triangulation...

An Efficient Approach of Convex Hull Triangulation Based on Monotonic Chain

Abstract:

The triangulation of convex hull has the characteristics of point-set and polygon triangulation. According to some relative definitions, this paper proposed a triangulation of convex hull based on a monotonic chain. This method is better than Delaunay algorithm and is more efficient than other convex polygon algorithms. It is a good algorithm.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 263-266)

Pages:

1605-1608

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.263-266.1605

Citation:

Cite this paper

Online since:

December 2012

Authors:

Yu Ping Zhang*, Zhao Ri Deng, Rui Qi Zhang

Keywords:

Convex Hull, Mesh Data, Monotonic Chain, Triangulation Algorithm

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] F.P. Prepatata. Computational Geometry, An Introduction[M]. New York: Springer-Verlag, 1985.

Google Scholar

[2] Oswin Aichholzer. Towards compatible triangulations[J]. Theoretical Computer Science, 2003,296(1):3~13.

DOI: 10.1016/s0304-3975(02)00428-0

Google Scholar

[3] Marc Vigo. Regular triangulations of dynamic sets of points[J]. Computer Aided Geometric Design, 2002,19(2):127-149

DOI: 10.1016/s0167-8396(01)00082-6

Google Scholar

[4] Fortune S. Voronoi diagrams. In: Du D Z(ed). Computing in Euclidean geometry[M], New York:World Scientific Publishing Co. Pte. Ltd, 1995.231 – 245

Google Scholar

[5] Forrest A R. Computational Geometry[M], Proc. Royal Society London, 1971, 321(4):187~195

Google Scholar