---
_id: '4040'
abstract:
- lang: eng
text: A plane geometric graph C in ℝ2 conforms to another such graph G if each edge
of G is the union of some edges of C. It is proved that, for every G with n vertices
and m edges, there is a completion of a Delaunay triangulation of O(m2 n) points
that conforms to G. The algorithm that constructs the points is also described.
acknowledgement: 'Research of the first author is supported by the National Science
Foundation under Grant CCR-8921421 and under the Alan T. Waterman award, Grant CCR-9118874.
Any opinions, findings, and conclusions or recommendations expressed in this publication
are those of the authors and do not necessarily reflect the view of the National
Science Foundation. Work of the second author was conducted while he was on study
leave at the University of Illinois. '
article_processing_charge: No
article_type: original
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Tiow
full_name: Tan, Tiow
last_name: Tan
citation:
ama: Edelsbrunner H, Tan T. An upper bound for conforming Delaunay triangulations.
Discrete & Computational Geometry. 1993;10(1):197-213. doi:10.1007/BF02573974
apa: Edelsbrunner, H., & Tan, T. (1993). An upper bound for conforming Delaunay
triangulations. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/BF02573974
chicago: Edelsbrunner, Herbert, and Tiow Tan. “An Upper Bound for Conforming Delaunay
Triangulations.” Discrete & Computational Geometry. Springer, 1993.
https://doi.org/10.1007/BF02573974.
ieee: H. Edelsbrunner and T. Tan, “An upper bound for conforming Delaunay triangulations,”
Discrete & Computational Geometry, vol. 10, no. 1. Springer, pp. 197–213,
1993.
ista: Edelsbrunner H, Tan T. 1993. An upper bound for conforming Delaunay triangulations.
Discrete & Computational Geometry. 10(1), 197–213.
mla: Edelsbrunner, Herbert, and Tiow Tan. “An Upper Bound for Conforming Delaunay
Triangulations.” Discrete & Computational Geometry, vol. 10, no. 1,
Springer, 1993, pp. 197–213, doi:10.1007/BF02573974.
short: H. Edelsbrunner, T. Tan, Discrete & Computational Geometry 10 (1993)
197–213.
date_created: 2018-12-11T12:06:35Z
date_published: 1993-12-01T00:00:00Z
date_updated: 2022-03-28T14:58:16Z
day: '01'
doi: 10.1007/BF02573974
extern: '1'
intvolume: ' 10'
issue: '1'
language:
- iso: eng
main_file_link:
- url: https://link.springer.com/article/10.1007/BF02573974
month: '12'
oa_version: None
page: 197 - 213
publication: Discrete & Computational Geometry
publication_identifier:
issn:
- 0179-5376
publication_status: published
publisher: Springer
publist_id: '2084'
quality_controlled: '1'
status: public
title: An upper bound for conforming Delaunay triangulations
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 10
year: '1993'
...