Article

Free access

Decomposing polygonal regions into convex quadrilaterals

Author:

Anna LubiwAuthors Info & Claims

SCG '85: Proceedings of the first annual symposium on Computational geometry

Pages 97 - 106

https://doi.org/10.1145/323233.323247

Published: 01 June 1985 Publication History

PDF eReader

References

[1]

{AHU} A. V. Aho, J. E. Hopcroft, and J. P. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading MA, 1974.

Digital Library

Google Scholar

[2]

{CD} B. Chazelle and D. Dobkin, Decomposing a polygon into its convex parts, Proc. 11th Annual ACM Symp. on Theory of Computing, 1979, 34-48.

Digital Library

Google Scholar

[3]

{EOW} H. Edelsbrunner, J. O'Rourke, E. Welzl. Stationing guards in rectilinear art galleries, Computer Vision, Graphics, and Image Processing 27, 1984, 167-176.

Google Scholar

[4]

{F} S. Fisk, A short proof of Chvátal's watchman theorem, J. Combinatorial Theory B 24, 1978, 374.

Crossref

Google Scholar

[5]

{GJ} M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness , Freeman, San Francisco, 1979.

Digital Library

Google Scholar

[6]

{GJPT} M. R. Garey, D. S. Johnson, F. P. Preparata and R. E. Tarjan, Triangulating a simple polygon, Information Processing Letters 7, 1978, 175- 179.

Crossref

Google Scholar

[7]

{K} J. M. Keil, Decomposing Polygons into Simpler Components, Ph.D. thesis, Dept. Computer Science, U. of Toronto, 1983.

Google Scholar

[8]

{KKK} J. Kahn, M. Klawe and D. Kleitman. Traditional galleries require fewer watchmen, SIAM J. Algebraic and Discrete Methods 4, 1983, 194- 206.

Crossref

Google Scholar

[9]

{L} D. Lichtenstein, Planar satisfiability and its uses, SIAM J. Computing 11, 1982, 329-343.

Crossref

Google Scholar

[10]

{Ln} A. Lingas, The power of non-rectilinear holes, Proc. 9th Coll. on Automata, Languages, and Programming, Lecture Notes in Computer Science 140, Springer-Verlag, New York, 1982, 369-383.

Digital Library

Google Scholar

[11]

{LPRS} A. Lingas, R. Y. Pinter, R. L. Rivest, A. Shamir, Minimum edge length decomposition of rectilinear polygons, unpublished manuscript.

Google Scholar

[12]

{O} J. O'Rourke, An alternate proof of the rectilinear art gallery theorem, J. Geometry 21, 1983, 118-130.

Crossref

Google Scholar

[13]

{PS} W. Paul and J. Simon, Decision trees and random access machines, Logic and Algorithmic, Monograph 30, L'Enseignement Mathematique, 1980.

Google Scholar

[14]

{PLLML} L. Pagli, E. Lodi, F. Luccio, C. Mugnai, W. Lipski, On two dimensional data organization 2, Fundamenta Informaticae, Vol. 2, No. 3, 1979.

Google Scholar

[15]

{S} J.-R. Sack, An O(nlogn) algorithm for decomposing simple rectilinear polygons into convex quadrilaterals, Proc. 20th Allerton Conf., 1982, 64-74.

Google Scholar

[16]

{SH} M. I. Shamos and D. J. Hoey, Geometric intersection problems, Proc. 17th Annual IEEE Symp. on Foundations of Computer Science, 1976, 208-215.

Digital Library

Google Scholar

[17]

{T} G. T. Toussaint. Pattern recognition and geometric complexity, 5th Internat. Conf. on Pattern Recognition, 1980, 1324-1347.

Google Scholar

[18]

{Ta} R. E. Tarjan, Data Structures and Network Algorithms, CBMS-NSF Regional Conf. Series in Applied Math., SIAM, Philadelphia, 1983.

Google Scholar

Cited By

View all

Abrahamsen MBlikstad JNusser AZhang HMohar BShinkar IO'Donnell R(2024)Minimum Star Partitions of Simple Polygons in Polynomial TimeProceedings of the 56th Annual ACM Symposium on Theory of Computing10.1145/3618260.3649756(904-910)Online publication date: 10-Jun-2024
https://dl.acm.org/doi/10.1145/3618260.3649756
Maity ADutt MBiswas A(2023)Rectangularization of Digital Objects and Its Relation with Straight SkeletonsCombinatorial Image Analysis10.1007/978-3-031-23612-9_2(31-45)Online publication date: 1-Jan-2023
https://doi.org/10.1007/978-3-031-23612-9_2
Banerjee DInkulu R(2022)Vertex Guarding for Dynamic Orthogonal Art GalleriesInternational Journal of Computational Geometry & Applications10.1142/S021819592150006031:02n03(123-140)Online publication date: 25-Jan-2022
https://doi.org/10.1142/S0218195921500060
Show More Cited By

Index Terms

Decomposing polygonal regions into convex quadrilaterals
1. Mathematics of computing
  1. Discrete mathematics
2. Theory of computation
  1. Computational complexity and cryptography
    1. Problems, reductions and completeness
  2. Randomness, geometry and discrete structures
    1. Computational geometry

Recommendations

Acute triangulations of convex quadrilaterals

An acute triangulation of a polygon @C is a triangulation of @C into acute triangles. Let f(@C) denote the minimum number of triangles necessary for an acute triangulation of @C. We prove that the maximum value of f(Q) for all convex quadrilaterals Q is ...
POLYLLA: polygonal meshing algorithm based on terminal-edge regions
Abstract
This paper presents an algorithm to generate a new kind of polygonal mesh obtained from triangulations. Each polygon is built from a terminal-edge region surrounded by edges that are not the longest-edge of any of the two triangles that share ...
A new quality preserving polygonal mesh refinement algorithm for Polygonal Element Methods
Abstract
Mesh adaptivity is a useful tool for efficient solution to partial differential equations in very complex geometries. In the present paper we discuss the use of polygonal mesh refinement in order to tackle two common issues: first, ...
Highlights
- A new refinement strategy for general convex polygons.
- Quality measure of a ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

SCG '85: Proceedings of the first annual symposium on Computational geometry

June 1985

322 pages

ISBN:0897911636

DOI:10.1145/323233

Chairman:
Joseph O'Rourke
Johns Hopkins Univ., Baltimore, MD

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 1985

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SCG85

Sponsor:

SCG85: The 1st Annual ACM SIGACT/SIGGRAPH Symposium on Computational Geometry 1985

June 5 - 7, 1985

Maryland, Baltimore, USA

Acceptance Rates

Overall Acceptance Rate 625 of 1,685 submissions, 37%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

32
Total Citations
View Citations
877
Total Downloads

Downloads (Last 12 months)91
Downloads (Last 6 weeks)8

Reflects downloads up to 23 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Abrahamsen MBlikstad JNusser AZhang HMohar BShinkar IO'Donnell R(2024)Minimum Star Partitions of Simple Polygons in Polynomial TimeProceedings of the 56th Annual ACM Symposium on Theory of Computing10.1145/3618260.3649756(904-910)Online publication date: 10-Jun-2024
https://dl.acm.org/doi/10.1145/3618260.3649756
Maity ADutt MBiswas A(2023)Rectangularization of Digital Objects and Its Relation with Straight SkeletonsCombinatorial Image Analysis10.1007/978-3-031-23612-9_2(31-45)Online publication date: 1-Jan-2023
https://doi.org/10.1007/978-3-031-23612-9_2
Banerjee DInkulu R(2022)Vertex Guarding for Dynamic Orthogonal Art GalleriesInternational Journal of Computational Geometry & Applications10.1142/S021819592150006031:02n03(123-140)Online publication date: 25-Jan-2022
https://doi.org/10.1142/S0218195921500060
Pilz ASeara C(2020)Convex Quadrangulations of Bichromatic Point SetsInternational Journal of Computational Geometry & Applications10.1142/S021819591950010929:04(289-299)Online publication date: 6-May-2020
https://doi.org/10.1142/S0218195919500109
Eppstein D(2020)Counting Polygon Triangulations is HardDiscrete & Computational Geometry10.1007/s00454-020-00251-7Online publication date: 13-Oct-2020
https://doi.org/10.1007/s00454-020-00251-7
Biedl TChan TLee SMehrabi SMontecchiani FVosoughpour HYu Z(2019)Guarding Orthogonal Art Galleries with Sliding k-TransmittersAlgorithmica10.1007/s00453-018-0433-681:1(69-97)Online publication date: 1-Jan-2019
https://dl.acm.org/doi/10.1007/s00453-018-0433-6
Biedl TChan TLee SMehrabi SMontecchiani FVosoughpour H(2017)On Guarding Orthogonal Polygons with Sliding CamerasWALCOM: Algorithms and Computation10.1007/978-3-319-53925-6_5(54-65)Online publication date: 21-Feb-2017
https://doi.org/10.1007/978-3-319-53925-6_5
Michael TPinciu V(2016)The Orthogonal Art Gallery Theorem with Constrained GuardsElectronic Notes in Discrete Mathematics10.1016/j.endm.2016.09.00654(27-32)Online publication date: Oct-2016
https://doi.org/10.1016/j.endm.2016.09.006
Michael TPinciu V(2016)How to Guard Orthogonal PolygonsDiscrete & Computational Geometry10.1007/s00454-015-9756-055:2(410-422)Online publication date: 1-Mar-2016
https://dl.acm.org/doi/10.1007/s00454-015-9756-0
Maßberg J(2014)Perfect Graphs and Guarding Rectilinear Art GalleriesDiscrete & Computational Geometry10.1007/s00454-014-9587-451:3(569-577)Online publication date: 8-Apr-2014
https://doi.org/10.1007/s00454-014-9587-4
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

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

Cited By

Index Terms

Recommendations

Acute triangulations of convex quadrilaterals

POLYLLA: polygonal meshing algorithm based on terminal-edge regions

A new quality preserving polygonal mesh refinement algorithm for Polygonal Element Methods