Triangulations in CGAL

被引：110

作者：

Boissonnat, JD ^{[1
]}

Devillers, O ^{[1
]}

Pion, S ^{[1
]}

Teillaud, M ^{[1
]}

Yvinec, M ^{[1
]}

机构：

[1] INRIA, F-06902 Sophia Antipolis, France

来源：

COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS | 2002年 / 22卷 / 1-3期

关键词：

triangulation; Delaunay triangulation; implementation;

D O I：

10.1016/S0925-7721(01)00054-2

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

This paper presents the main algorithmic and design choices that have been made to implement triangulations in the computational geometry algorithms library CGAL. (C) 2001 Elsevier Science B.V. All rights reserved.

引用

页码：5 / 19

页数：15

共 42 条

[1]

[Anonymous], P 7 ANN S COMP GEOM

[2]

[Anonymous], TRIANGULATION DELAUN

[3]

[Anonymous], 1998, Algorithmic Geometry

[4]

AURENHAMMER F, 1991, COMPUT SURV, V23, P345, DOI 10.1145/116873.116880

[5]

BARBER B, QHULL VERSION 2 3

[6] The Quickhull algorithm for convex hulls [J].

Barber, CB ;

Dobkin, DP ;

Huhdanpaa, H .

ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 1996, 22 (04) :469-483

[7]

BERN M, 1992, LECT NOTES SERIES CO, V1, P23

[8]

BERTRAND Y, 1994, CVGIP-GRAPH MODEL IM, V56, P29, DOI 10.1006/cgip.1994.1005

[9] REPRESENTING GEOMETRIC STRUCTURES IN D-DIMENSIONS - TOPOLOGY AND ORDER [J].

BRISSON, E .

DISCRETE & COMPUTATIONAL GEOMETRY, 1993, 9 (04) :387-426

[10]

Bronnimann H., 1998, Proceedings of the Fourteenth Annual Symposium on Computational Geometry, P165, DOI 10.1145/276884.276903

← 1 2 3 4 5 →