✦ LIBER ✦

Regular triangulations of dynamic sets of points

✍ Scribed by Marc Vigo; Núria Pla; Josep Cotrina

Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 596 KB
Volume: 19
Category: Article
ISSN: 0167-8396
DOI: 10.1016/s0167-8396(01)00082-6

No coin nor oath required. For personal study only.

✦ Synopsis

The Delaunay triangulations of a set of points are a class of triangulations which play an important role in a variety of different disciplines of science. Regular triangulations are a generalization of Delaunay triangulations that maintain both their relationship with convex hulls and with Voronoi diagrams. In regular triangulations, a real value, its weight, is assigned to each point.

In this paper a simple data structure is presented that allows regular triangulations of sets of points to be dynamically updated, that is, new points can be incrementally inserted in the set and old points can be deleted from it. The algorithms we propose for insertion and deletion are based on a geometric interpretation of the history data structure in one more dimension and use lifted flips as the unique topological operation. This results in rather simple and efficient algorithms. The algorithms have been implemented and experimental results are given.

📜 SIMILAR VOLUMES

Unitary designs with regular sets of poi

Unitary designs with regular sets of points

✍ J.D. Key; N.K.A. Rostom 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 651 KB

A regular set for a design D is a set Q of points such that only the identity automorphism of D ties the set Q. It is shown that if D is the classical unital U(q) or the Ree unital M(q) where q 3 3 then D has regular sets.

Inversive Planes, Minkowski Planes and R

Inversive Planes, Minkowski Planes and Regular Sets of Points

✍ Gloria Rinaldi 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 94 KB

New examples of regular sets of points for the Miquelian inversive planes of order q, q a prime power, q ≥ 7, are found and connections between such planes and certain Minkowski planes of order q 2 are presented.

Regularization of a set of Pareto points

✍ D.A. Molodtsov 📂 Article 📅 1978 🏛 Elsevier Science ⚖ 396 KB

Dynamical sets of points

✍ Thomas Ottmann; Derick Wood 📂 Article 📅 1984 🏛 Elsevier Science ⚖ 89 KB

Defining sets as sets of points of space

Defining sets as sets of points of spaces

✍ Colin McLarty 📂 Article 📅 1988 🏛 Springer Netherlands 🌐 English ⚖ 895 KB

Regular closed sets of permutations

✍ M.H. Albert; M.D. Atkinson; N. Ruškuc 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 301 KB

Machines whose main purpose is to permute and sort data are studied. The sets of permutations that can arise are analysed by means of ÿnite automata and avoided pattern techniques. Conditions are given for these sets to be enumerated by rational generating functions. As a consequence we give the ÿrs