Compatible Triangulations and Point Partitions by Series-Triangular Graphs

Simple item page
dc.creatorDanciger, Jeff
dc.creatorDevadoss, Satyan L.
dc.creatorSheehy, Don
dc.date2005-02-08
dc.date.accessioned2026-07-07T06:31:25Z
dc.date.available2026-07-07T06:31:25Z
dc.descriptionWe introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to improve the upper bound on the number of Steiner points needed to obtain compatible triangulations of point sets. The problem is generalized to finding compatible triangulations for more than two point sets and we show that such triangulations can be constructed with only a linear number of Steiner points added to each point set.
dc.description11 pages, 8 figures
dc.identifierhttps://arxiv.org/abs/cs/0502043
dc.identifierhttp://arxiv.org/abs/cs/0502043
dc.identifierComputational Geometry: Theory and Applications, 34 (2006) 195-202
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/98596
dc.subjectComputational Geometry
dc.subjectDiscrete Mathematics
dc.titleCompatible Triangulations and Point Partitions by Series-Triangular Graphs
dc.typetext

Files

Collections

arXiv