article

Free access

Triangulation and shape-complexity

Authors:

B. Chazelle,

J. IncerpiAuthors Info & Claims

ACM Transactions on Graphics (TOG), Volume 3, Issue 2

Pages 135 - 152

https://doi.org/10.1145/357337.357340

Published: 01 April 1984 Publication History

PDF eReader

References

[1]

CHAZELLE, B. A theorem on polygon-cutting with applications. In Proceedings o{ the 23rd IEEE Annual Symposium on Foundations of Computer Science, (Chicago, Nov. 3-5 1982). IEEE, New York, pp. 339-349.

Google Scholar

[2]

GAREY, M. R., JOHNSON, D. S., PREPARATA, F. P. AND TARJAN, R.E. Triangulating a simple polygon, inf. Proc. Lett. 7, 4 (June 1978), 175-180.

Google Scholar

[3]

GUIBAS, L., AND STOLFI, d. Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams. In Proceedings o{ the 15th ACM Annual Symposium on Theory of Computing, (Boston, April 25-27 1983) ACM, New York, pp. 221-234.

Crossref

Google Scholar

[4]

HERTEL, S., AND MEHLHORN, K. Fast triangulation of simple polygon. In Proceedings of the Conference on Foundations of Computing Theory (Borgholm, Sweden, Aug. 21-27). Springer- Verlag, New York, 1983, 207-218.

Crossref

Google Scholar

[5]

KNUTH, D.E. The Art of Computer Programming: Sorting and Searching. Vol. 3, Addison- Wesley, Reading, Mass., 1973.

Crossref

Google Scholar

[6]

SHAMOS, M.I. Computational geometry. PhD dissertation, Dept. of Computer Science, Yale University, New Haven, Conn., 1978.

Crossref

Google Scholar

[7]

SCHOONE, A. A., AND VAN LEEUWEN, J. Triangulating a star-shaped polygon. Tech. Rep. RUV- CS-80-3, Univ. of Utrecht, April 1980.

Google Scholar

[8]

TOUSSAINT, G.T. Pattern recognition and geometrical complexity. In Proceedings of the 5th International Conference on Pattern Recognition (Dec. 1980), pp. 1324-1347.

Google Scholar

[9]

TOUSSAINT, G. W., AND AVIS, D. On a convex hull algorithm for polygons and its application to triangulation problems. Pattern Recog. 15, 1 (1982) 23-29.

Google Scholar

Cited By

View all

Hershberger J(2023)An optimal visibility graph algorithm for triangulated simple polygonsAlgorithmica10.1007/BF015538834:1-4(141-155)Online publication date: 22-Mar-2023
https://dl.acm.org/doi/10.1007/BF01553883
Bazazian DMagland BGrimm CChambers ELeonard K(2022)Perceptually grounded quantification of 2D shape complexityThe Visual Computer10.1007/s00371-022-02634-838:9-10(3351-3363)Online publication date: 9-Aug-2022
https://doi.org/10.1007/s00371-022-02634-8
Zhang PFan JZhang PZhang ZChen ZHan L(2021)Comparative Study on the Effect of Shape Complexity on the Efficiency of Different Overlay Analysis AlgorithmsIEEE Access10.1109/ACCESS.2021.31217539(144179-144194)Online publication date: 2021
https://doi.org/10.1109/ACCESS.2021.3121753
Show More Cited By

Index Terms

Triangulation and shape-complexity

Recommendations

Empty-shape triangulation algorithms
Well-Centered Triangulation

Meshes composed of well-centered simplices have nice orthogonal dual meshes (the dual Voronoi diagram). This is useful for certain numerical algorithms that prefer such primal-dual mesh pairs. We prove that well-centered meshes also have optimality ...
A spectral characterization of the Delaunay triangulation

The Delaunay triangulation of a planar point set is a fundamental construct in computational geometry. A simple algorithm to generate it is based on flips of diagonal edges in convex quads. We characterize the effect of a single edge flip in a ...

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Graphics

ACM Transactions on Graphics Volume 3, Issue 2

April 1984

90 pages

ISSN:0730-0301

EISSN:1557-7368

DOI:10.1145/357337

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 April 1984

Published in TOG Volume 3, Issue 2

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

97
Total Citations
View Citations
1,231
Total Downloads

Downloads (Last 12 months)74
Downloads (Last 6 weeks)11

Reflects downloads up to 26 Jul 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Hershberger J(2023)An optimal visibility graph algorithm for triangulated simple polygonsAlgorithmica10.1007/BF015538834:1-4(141-155)Online publication date: 22-Mar-2023
https://dl.acm.org/doi/10.1007/BF01553883
Bazazian DMagland BGrimm CChambers ELeonard K(2022)Perceptually grounded quantification of 2D shape complexityThe Visual Computer10.1007/s00371-022-02634-838:9-10(3351-3363)Online publication date: 9-Aug-2022
https://doi.org/10.1007/s00371-022-02634-8
Zhang PFan JZhang PZhang ZChen ZHan L(2021)Comparative Study on the Effect of Shape Complexity on the Efficiency of Different Overlay Analysis AlgorithmsIEEE Access10.1109/ACCESS.2021.31217539(144179-144194)Online publication date: 2021
https://doi.org/10.1109/ACCESS.2021.3121753
Arslan MTari S(2020) Complexity of Shapes Embedded in Z n With a Bias Towards Squares IEEE Transactions on Image Processing10.1109/TIP.2020.302131629(8870-8879)Online publication date: 2020
https://doi.org/10.1109/TIP.2020.3021316
Zhao KJin BFan HYang M(2020)A Data Allocation Strategy for Geocomputation Based on Shape Complexity in A Cloud Environment Using Parallel Overlay Analysis of Polygons as an ExampleIEEE Access10.1109/ACCESS.2020.30307008(185981-185991)Online publication date: 2020
https://doi.org/10.1109/ACCESS.2020.3030700
Ying HLee S(2020)Automatic Detection of Geometric Errors in Space Boundaries of IFC-BIM Models Using Monte Carlo Ray Tracing ApproachJournal of Computing in Civil Engineering10.1061/(ASCE)CP.1943-5487.000087834:2Online publication date: Mar-2020
https://doi.org/10.1061/(ASCE)CP.1943-5487.0000878
Kuipers TDoubrovski EWu JWang C(2020)A framework for adaptive width control of dense contour-parallel toolpaths in fused deposition modelingComputer-Aided Design10.1016/j.cad.2020.102907(102907)Online publication date: Jun-2020
https://doi.org/10.1016/j.cad.2020.102907
Papadimitriou FPapadimitriou F(2020)What is Spatial Complexity?Spatial Complexity10.1007/978-3-030-59671-2_1(3-18)Online publication date: 3-Nov-2020
https://doi.org/10.1007/978-3-030-59671-2_1
Mitchell JPolishchuk VSysikaski MWang H(2019)An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear DomainsAlgorithmica10.1007/s00453-018-0446-181:1(289-316)Online publication date: 1-Jan-2019
https://dl.acm.org/doi/10.1007/s00453-018-0446-1
Qingge LHe XLiu ZZhu BShehu AWu CBoucher CLi JLiu HPop M(2018)On the Minimum Copy Number Generation Problem in Cancer GenomicsProceedings of the 2018 ACM International Conference on Bioinformatics, Computational Biology, and Health Informatics10.1145/3233547.3233586(260-269)Online publication date: 15-Aug-2018
https://dl.acm.org/doi/10.1145/3233547.3233586
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

References

Cited By

Index Terms

Recommendations

Empty-shape triangulation algorithms

Well-Centered Triangulation

A spectral characterization of the Delaunay triangulation

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations