Degree bounds for constrained pseudo-triangulations

O. Aichholzer; M. Hoffmann; B. Speckmann; Cs.D. Tóth

Degree bounds for constrained pseudo-triangulations

O. Aichholzer, M. Hoffmann, B. Speckmann, Cs.D. Tóth

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

2 Downloads (Pure)

Abstract

We introduce the concept of a constrained pointed pseudo-triangulation TG of a point set S with respect to a pointed planar straight line graph G = (S,E). For the case that G forms a simple polygon P with vertex set S we give tight bounds on the vertex degree of TG.

Original language	English
Title of host publication	Proceedings of the 15th Canadian Conference on Computational Geometry (CCCG'03, Halifax, Nova Scotia, Canada, August 11-13, 2003), Electronic proceedings
Pages	155-158
Publication status	Published - 2003

Cite this

@inproceedings{86498fe7624a4f37a17ce88c86309964,

title = "Degree bounds for constrained pseudo-triangulations",

abstract = "We introduce the concept of a constrained pointed pseudo-triangulation TG of a point set S with respect to a pointed planar straight line graph G = (S,E). For the case that G forms a simple polygon P with vertex set S we give tight bounds on the vertex degree of TG.",

author = "O. Aichholzer and M. Hoffmann and B. Speckmann and Cs.D. T{\'o}th",

year = "2003",

language = "English",

pages = "155--158",

booktitle = "Proceedings of the 15th Canadian Conference on Computational Geometry (CCCG'03, Halifax, Nova Scotia, Canada, August 11-13, 2003), Electronic proceedings",

}

Degree bounds for constrained pseudo-triangulations. / Aichholzer, O.; Hoffmann, M.; Speckmann, B. et al.
Proceedings of the 15th Canadian Conference on Computational Geometry (CCCG'03, Halifax, Nova Scotia, Canada, August 11-13, 2003), Electronic proceedings. 2003. p. 155-158.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Degree bounds for constrained pseudo-triangulations

AU - Aichholzer, O.

AU - Hoffmann, M.

AU - Speckmann, B.

AU - Tóth, Cs.D.

PY - 2003

Y1 - 2003

N2 - We introduce the concept of a constrained pointed pseudo-triangulation TG of a point set S with respect to a pointed planar straight line graph G = (S,E). For the case that G forms a simple polygon P with vertex set S we give tight bounds on the vertex degree of TG.

AB - We introduce the concept of a constrained pointed pseudo-triangulation TG of a point set S with respect to a pointed planar straight line graph G = (S,E). For the case that G forms a simple polygon P with vertex set S we give tight bounds on the vertex degree of TG.

M3 - Conference contribution

SP - 155

EP - 158

BT - Proceedings of the 15th Canadian Conference on Computational Geometry (CCCG'03, Halifax, Nova Scotia, Canada, August 11-13, 2003), Electronic proceedings

ER -

Degree bounds for constrained pseudo-triangulations

Abstract

Fingerprint

Cite this