IEICE TRANSACTIONS on Information
Efficient Generation of Plane Triangulations with Specified Maximum Degree
Summary :
A "based" plane triangulation is a plane triangulation with one designated edge on the outer face. In this paper we give a simple algorithm to generate all biconnected based plane triangulations having exactly n vertices and with the maximum degree exactly D. The algorithm uses O(n) space and generates such triangulations in O(1) time per triangulation without duplications.
- Publication
- IEICE TRANSACTIONS on Information Vol.E87-D No.2 pp.330-336
- Publication Date
- 2004/02/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Section on Foundations of Computer Science)
- Category
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Hiroyuki TANAKA, Shin-ichi NAKANO, "Efficient Generation of Plane Triangulations with Specified Maximum Degree" in IEICE TRANSACTIONS on Information,
vol. E87-D, no. 2, pp. 330-336, February 2004, doi: .
Abstract: A "based" plane triangulation is a plane triangulation with one designated edge on the outer face. In this paper we give a simple algorithm to generate all biconnected based plane triangulations having exactly n vertices and with the maximum degree exactly D. The algorithm uses O(n) space and generates such triangulations in O(1) time per triangulation without duplications.
URL: https://global.ieice.org/en_transactions/information/10.1587/e87-d_2_330/_p
Copy
@ARTICLE{e87-d_2_330,
author={Hiroyuki TANAKA, Shin-ichi NAKANO, },
journal={IEICE TRANSACTIONS on Information},
title={Efficient Generation of Plane Triangulations with Specified Maximum Degree},
year={2004},
volume={E87-D},
number={2},
pages={330-336},
abstract={A "based" plane triangulation is a plane triangulation with one designated edge on the outer face. In this paper we give a simple algorithm to generate all biconnected based plane triangulations having exactly n vertices and with the maximum degree exactly D. The algorithm uses O(n) space and generates such triangulations in O(1) time per triangulation without duplications.},
keywords={},
doi={},
ISSN={},
month={February},}
Copy
TY - JOUR
TI - Efficient Generation of Plane Triangulations with Specified Maximum Degree
T2 - IEICE TRANSACTIONS on Information
SP - 330
EP - 336
AU - Hiroyuki TANAKA
AU - Shin-ichi NAKANO
PY - 2004
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E87-D
IS - 2
JA - IEICE TRANSACTIONS on Information
Y1 - February 2004
AB - A "based" plane triangulation is a plane triangulation with one designated edge on the outer face. In this paper we give a simple algorithm to generate all biconnected based plane triangulations having exactly n vertices and with the maximum degree exactly D. The algorithm uses O(n) space and generates such triangulations in O(1) time per triangulation without duplications.
ER -
English
