Quadrangulations of planar sets

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Given a set S such as a polygon or a set of points, a quadrangulation of S is a partition of the interior of S, if 5 is a polygon, or the interior of the convex hull of S, if 5 is a set of points, into quadrangles (quadrilaterals) obtained by inserting edges between pairs of points (diagonals between vertices of the polygon) such that the edges intersect each other only at their end points. Not all polygons or sets of points admit quadrangulations, even when the quadrangles are not required to be convex (convex quadrangulations). In this paper we briefly survey some recent results concerning the characterization of those planar sets that always admit quadrangulations (convex and non-convex) as well as some related computational problems.

Original languageEnglish (US)
Title of host publicationAlgorithms and Data Structures - 4th International Workshop, WADS 1995, Proceedings
PublisherSpringer-Verlag
Pages218-227
Number of pages10
ISBN (Print)3540602208, 9783540602200
DOIs
StatePublished - Jan 1 1995
Event4th Workshop on Algorithms and Data Structures, WADS 1995 - Kingston, Canada
Duration: Aug 16 1995Aug 18 1995

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume955
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other4th Workshop on Algorithms and Data Structures, WADS 1995
CountryCanada
CityKingston
Period8/16/958/18/95

Fingerprint

Quadrangulation
Polygon
Set of points
Interior
End point
Intersect
Convex Hull
Partition

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Toussaint, G. (1995). Quadrangulations of planar sets. In Algorithms and Data Structures - 4th International Workshop, WADS 1995, Proceedings (pp. 218-227). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 955). Springer-Verlag. https://doi.org/10.1007/3-540-60220-8_64

Quadrangulations of planar sets. / Toussaint, Godfried.

Algorithms and Data Structures - 4th International Workshop, WADS 1995, Proceedings. Springer-Verlag, 1995. p. 218-227 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 955).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Toussaint, G 1995, Quadrangulations of planar sets. in Algorithms and Data Structures - 4th International Workshop, WADS 1995, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 955, Springer-Verlag, pp. 218-227, 4th Workshop on Algorithms and Data Structures, WADS 1995, Kingston, Canada, 8/16/95. https://doi.org/10.1007/3-540-60220-8_64
Toussaint G. Quadrangulations of planar sets. In Algorithms and Data Structures - 4th International Workshop, WADS 1995, Proceedings. Springer-Verlag. 1995. p. 218-227. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/3-540-60220-8_64
Toussaint, Godfried. / Quadrangulations of planar sets. Algorithms and Data Structures - 4th International Workshop, WADS 1995, Proceedings. Springer-Verlag, 1995. pp. 218-227 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{d9d51e7eb53646cabb0f5bdd05ae74cf,
title = "Quadrangulations of planar sets",
abstract = "Given a set S such as a polygon or a set of points, a quadrangulation of S is a partition of the interior of S, if 5 is a polygon, or the interior of the convex hull of S, if 5 is a set of points, into quadrangles (quadrilaterals) obtained by inserting edges between pairs of points (diagonals between vertices of the polygon) such that the edges intersect each other only at their end points. Not all polygons or sets of points admit quadrangulations, even when the quadrangles are not required to be convex (convex quadrangulations). In this paper we briefly survey some recent results concerning the characterization of those planar sets that always admit quadrangulations (convex and non-convex) as well as some related computational problems.",
author = "Godfried Toussaint",
year = "1995",
month = "1",
day = "1",
doi = "10.1007/3-540-60220-8_64",
language = "English (US)",
isbn = "3540602208",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer-Verlag",
pages = "218--227",
booktitle = "Algorithms and Data Structures - 4th International Workshop, WADS 1995, Proceedings",

}

TY - GEN

T1 - Quadrangulations of planar sets

AU - Toussaint, Godfried

PY - 1995/1/1

Y1 - 1995/1/1

N2 - Given a set S such as a polygon or a set of points, a quadrangulation of S is a partition of the interior of S, if 5 is a polygon, or the interior of the convex hull of S, if 5 is a set of points, into quadrangles (quadrilaterals) obtained by inserting edges between pairs of points (diagonals between vertices of the polygon) such that the edges intersect each other only at their end points. Not all polygons or sets of points admit quadrangulations, even when the quadrangles are not required to be convex (convex quadrangulations). In this paper we briefly survey some recent results concerning the characterization of those planar sets that always admit quadrangulations (convex and non-convex) as well as some related computational problems.

AB - Given a set S such as a polygon or a set of points, a quadrangulation of S is a partition of the interior of S, if 5 is a polygon, or the interior of the convex hull of S, if 5 is a set of points, into quadrangles (quadrilaterals) obtained by inserting edges between pairs of points (diagonals between vertices of the polygon) such that the edges intersect each other only at their end points. Not all polygons or sets of points admit quadrangulations, even when the quadrangles are not required to be convex (convex quadrangulations). In this paper we briefly survey some recent results concerning the characterization of those planar sets that always admit quadrangulations (convex and non-convex) as well as some related computational problems.

UR - http://www.scopus.com/inward/record.url?scp=79960588154&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79960588154&partnerID=8YFLogxK

U2 - 10.1007/3-540-60220-8_64

DO - 10.1007/3-540-60220-8_64

M3 - Conference contribution

AN - SCOPUS:79960588154

SN - 3540602208

SN - 9783540602200

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 218

EP - 227

BT - Algorithms and Data Structures - 4th International Workshop, WADS 1995, Proceedings

PB - Springer-Verlag

ER -