Fortune, S. 1992 Voronoi Diagrams and Delaunay Triangulations. In Euclidean Geometry and Computers, (D.A. Du, F.K. Hwang, eds.), p. 193, World Scientific Publishing Co. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Proximity Structures for Geometric Graphs - Kapoor, Li (Correct)
....of fundamental interest these structures have applications in topology control for wireless networks. 1 Introduction Given a set of two dimensional points, many geometric proximity structures were defined for various applications, such as the Delaunay triangulation [13 ] the Voronoi Diagram [2,3], the Gabriel graph (GG) 4, 5] and the relative neighborhood graph (RNG) 6 8] These diagrams are defined with respect to a geometric neighborhood. For example an edge uv is in GG if and only if the circle with uv as a diameter, denoted by disk(u, v) is empty of any other points of S inside. ....
Fortune, S.: Voronoi diagrams and Delaunay triangulations. In: F. K. Hwang and D. -Z. Du, editors, Computing in Euclidean Geometry, World Scientific, (1992) 193-233
Coverage in Wireless Ad Hoc Sensor Networks - Li, Wan, Frieder (2002) (5 citations) (Correct)
....also achieves the maximum closest sensor observability. Consequently, in the rest of the paper, we must only study how to find the best coverage path, which also achieves the maximum closest sensor observability. 2. 2 Geometry Notations Delaunay triangulation and Voronoi diagram [4], 5] 6] are widely used in many areas. We begin with definitions of the Voronoi diagram and the Delaunay triangulation. We assume that all wireless nodes are given as a set S of n vertices in a two dimensional space. Each node has some computational power. We also assume that there are no four ....
S. Fortune, "Voronoi Diagrams and Delaunay Triangulations," Computing in Euclidean Geometry, F.K. Hwang and D.-Z. Du, eds., pp. 193-233, Singapore: World Scientific, 1992.
A Strategy for Analysis of (molecular) Equilibrium .. - Hamprecht, Peter, .. (Correct)
....diagram is the dual of its Voronoi diagram: every two points whose Voronoi polyhedra share a face become Delaunay neighbors. If the points are nondegenerate, their Delaunay graph is a triangulation. Delaunay triangulations are optimal in the sense of avoiding long, skinny triangles (see, e.g. [24]) 11 IF there are any remaining edges, calculate the density gradient by dividing the density di#erence by the distance between the embedded points; let the edge o#ering the maximum gradient become a new edge of the basin spanning tree; ELSE point i becomes the root of a basin spanning ....
....implementation making use of Gower s embedding [27] and of neighborhood and range lists, the computational complexity is bounded, for dimensionality D 2, by the Delaunay triangulation; an optimal algorithm for it is O(N D 2 ) in the worst case. In practice, this estimate is too pessimistic [24] and construction of the range lists is the most time consuming part. The computational cost for the examples supplied was of the order of several hours on a PC as compared to weeks for the simulations on similar machines. R is an interpreter and a compiled executable would shorten execution time ....
S. Fortune. Voronoi diagrams and Delaunay triangulations. In Du D.-Z. and Hwang F., editors, Computing in Euclidean Geometry, volume 4 of Lecture notes series on Computing, pages 225--265. World Scientific, Singapore, 2nd edition, 1995.
Recursive Space Decompositions in Force-Directed Graph Drawing.. - Pulo (Correct)
....Voronoi Di agram (RVD) data structure. It is an extension of the Voronoi Diagram (VD) to have a recursire nature. The Voronoi Diagram is an efficient way of answering range queries, that is, for a set of sites in d d dimensional space (i.e. which site is nearest to a given query point [Fortune, 1992][O Rourke, 1998] An example VD is shown in Figure 5. The VD takes as input a set q of points in space called the sites, and constructs as output the Voronoi cells corresponding to these sites. The Voronoi cell associated with site s q is denoted by V (s) and is the set of all points in space ....
....Voronoi cell associated with site s q is denoted by V (s) and is the set of all points in space which are closer or equidistant to s than any other points in q. The Voronoi Diagram is the collection of Voronoi cells for all s q. It can be computed by various algorithms in O(n log n) time, for n [Fortune, 1992]. The general idea of the RVD is to have an independant sub Voronoi Diagram in every Voronoi cell. Example RYDs are illustrated in Figure 6. 3.1 Description We define the d dimensional RVD by presenting an algorithm for its construction. Each point will be Figure 5: The Voronoi Diagram of the ....
[Article contains additional citation context not shown here]
Fortune, S. (1992). Voronoi Dia- grams and Delaunay Triangulations, Computing in Euclidean Geometry, Ding-Zh Du and Frank Hwang (eds), World Scientific, Singapore.
Simplicial Mesh Generation And Maintenance - Shao (Correct)
.... C, is a simplicial complex if the faces of every simplex in C also belong to C, and the intersection of two simplices in C is either empty or a face of both. The dimension of C is dim C = maxtor dims. The underlying space of C is [ J C = Jcc rr. Delaunay triangulation and Voronoi diagrams[23]. Let P = Pl, Pn be a set of points in 11 d. The Delaunay triangulation and Voronoi diagram can be defined as dual structures of the point set . For a nonempty subset Q of P, the Voronoi cell of Q, V(Q) is the set of all points of 11 d equidistant from all sites in Q and closer to every ....
....triangulation to a Delaunay triangulation. Construction of Delaunay triangulations (and Voronoi diagrams) for a point set is well studied in computational geometry, and the algorith mic complexity is known to be at most as dimcult as that of construction convex hulls in one higher dimension[23]. Commonly used techniques for lower dimensional Delau nay triangulation are divide and conquer, plane sweep and randomized incremental algorithms[23, 32] all of which have similar bounds on running time (or expected running time) of O(nlogn) in 2 and O(n 2) in 3, and can be generalized to ....
[Article contains additional citation context not shown here]
S. Fortune, "Voronoi diagrams and Delaunay triangulations," Computing in Euclidean geometry, 225-265, D. Z. Du and F. Hwang ed, World Scientific, Singapore, 1995.
Fitting Triangular B-Splines to Functional Scattered Data - Pfeifle, Seidel (1996) (Correct)
....This would violate Property Three. It is clear that some other means of triangulating the data points must be used that adapts the size of triangles used to the local density of the data. The initial temptation is to use the sample (x; y) values as vertices of a Delaunay triangulation [For94]. This is, of course, ridiculous, as this choice results in an explosion of triangles. Another adaptive data structure commonly used for 2D domains is the quadtree, which we will use in the next section in order to build a triangulation. 3.2 Quadtree division of the domain We now describe a ....
S. Fortune. Voronoi diagrams and Delaunay triangulations. In D.-Z. Du and F.K. Hwang, editors, Computing in Euclidean Geometry, pages 193--233. World Scientific Publishing, 1994.
Adaptive Visualization For Interactive Geometric Modeling.. - Hong-Qian Karen Lu (2000) (3 citations) (Correct)
....earlier. The camera parameters and prespecified screen resolution are encoded in parameter C. The result of Traverse is a set of selected vertices. The DecimateOneCells function finds all the 1 cells in model M and decimates them to obtain edges. 4.5. Triangulation We use Delaunay triangulation [4], 16] to triangulate selected vertices in the parameter space of a surface. When edges are present, constrained Delaunay triangulation is applied to the vertices with edges as constraints. The resulting triangle mesh is mapped to the image space to approximate the original surface. During ....
S. Fortune, Voronoi Diagrams and Delaunay Triangulations, In F.K. Hwang and D.-Z. Du, editors, Computing in Euclidean Geometry, 2nd edition, pages 225-265, World Scientific, Singapore, 1995.
Kinematic Diffusion in Quasi-static Granular Deformation - Didwania, Ledniczky, Goddard (Correct)
No context found.
Fortune, S. 1992 Voronoi Diagrams and Delaunay Triangulations. In Euclidean Geometry and Computers, (D.A. Du, F.K. Hwang, eds.), p. 193, World Scientific Publishing Co.
Movement-Assisted Sensor Deployment - Guiling Wang Student (2003) (2 citations) (Correct)
No context found.
S. Fortune, D. Du, and F. Hwang, "Voronoi Diagrams and Delaunay Triangulations," Euclidean Geometry and Computers, 1992.
Movement-Assisted Sensor Deployment - Guiling Wang Guohong (2003) (2 citations) (Correct)
No context found.
D. Du and F. Hwang S. Fortune, "Voronoi diagrams and Delaunay triangulations," Euclidean Geometry and Computers, 1992.
Distributed Ranking Methods for Geographic.. - van Kreveld.. (2004) (1 citation) (Correct)
No context found.
S. Fortune. Voronoi diagrams and Delaunay triangulations. In D.-Z. Du and F. K. Hwang, editors, Computing in Euclidean Geometry, volume 4 of Lecture Notes Series on Computing, pages 225--265. World Scientific, Singapore, 2nd edition, 1995.
Maximizing a Voronoi Region: The Convex Case - Frank Dehne Rolf (2002) (2 citations) (Correct)
No context found.
S. Fortune. Voronoi diagrams and Delaunay triangulations. In Jacob E. Goodman and Joseph O'Rourke, editors, Handbook of Discrete and Computational Geometry, pages 377--388. CRC Press LLC, Boca Raton, FL, 1997.
Maximizing a Voronoi Region: The Convex Case - Dehne, Klein, Seidel (2005) (2 citations) (Correct)
No context found.
S. Fortune. Voronoi diagrams and Delaunay triangulations. In Jacob E. Goodman and Joseph O'Rourke, editors, Handbook of Discrete and Computational Geometry, pages 377--388. CRC Press LLC, Boca Raton, FL, 1997.
Beta-connection: An Approach to Generate Families of Models .. - Alex Jesus Quadros (2002) (Correct)
No context found.
S. Fortune, "Voronoi diagrams and Delaunay triangulation", in D-Z. Du, F.K. Hwang (eds.), Computing in Euclidean Geometry, Wor1d Scientific Pub. Co. (1994), 193-233.
3D Hybrid Mesh Generation For Reservoir Flow Simulation - Flandrin, Borouchaki, Bennis (2004) (Correct)
No context found.
Fortune S. "Voronoi diagrams and Delaunay triangulations. " J.E. Goodman, J. O'Rourke, editors, Handbook of Discrete and Computational Geometry, chap. 20, pp. 377--388. CRC Press LLC, 1997
Asynchronous Programming and Generation of Delaunay Triangulations .. - Sukup (2000) (Correct)
No context found.
S. Fortune. Voronoi diagrams and Delaunay triangulations. In F. K. Hwang and D.-Z. Du, editors, Computing in Euclidean Geometry, pages 193-233. World Scienti c, Singapore, 1992.
Distributed Ranking Methods for Geographic.. - van Kreveld.. (2004) (1 citation) (Correct)
No context found.
S. Fortune. Voronoi diagrams and Delaunay triangulations. In D.-Z. Du and F. K. Hwang, editors, Computing in Euclidean Geometry, volume 4 of Lecture Notes Series on Computing, pages 225--265. World Scientific, Singapore, 2nd edition, 1995.
Simultaneous Edge Flipping in Triangulations - Galtier Hurtado Noy (2003) (1 citation) (Correct)
No context found.
S. Fortune, Voronoi diagrams and Delaunay triangulations, in Computing in Euclidean geometry 2nd edition (1992), D.Z. Du and F.K. Hwang eds., World Scientific, 225-265. 16
Volume 20 (2001), number 2 pp. 1--14 COMPUTER GRAPHICS.. - Comparative Analysis In (Correct)
No context found.
S. Fortune. Voronoi diagrams and Delaunay triangulation. In D.-Z. Du and F. K. Hwang, editors, Computing in Euclidean Geometry, Wor1d Scientific, Singapore, pages 193--233. 1994.
Movement-Assisted Sensor Deployment - Guiling Wang Guohong (2003) (2 citations) (Correct)
No context found.
D. Du and F. Hwang S. Fortune, "Voronoi diagrams and Delaunay triangulations," Euclidean Geometry and Computers, 1992.
An Optimal Fault-Tolerant Broadcasting Algorithm In Voronoi.. - Baert, Semé (2003) (Correct)
No context found.
S. Fortune. Voronoi diagrams and Delaunay triangulations. In Ding-Zhu Du and Frank Hwang, editors, Computing in Euclidean Geometry, volume 1. World Scientific, Lecture Notes Series on Computing, 1992.
Parallel Edge Flipping - Hurtado, Noy, Urrutia (Correct)
No context found.
S. Fortune, Voronoi diagrams and Delaunay triangulations, in Computing in Euclidean geometry (
Diagonal Flips in Labelled Planar Triangulations - Gao, Urrutia, Wang (Correct)
No context found.
Fortune, S., "Voronoi diagrams and Delaunay triangulations", in Computing in Euclidean Geometry, D. Z. Du and F. K. Hwang eds., World Scientific, 1992, 193-234.
Practical Parallel Divide-and-Conquer Algorithms - Hardwick (1997) (1 citation) (Correct)
No context found.
Steven Fortune. Voronoi diagrams and Delaunay triangulations. In Ding-Zhu Du and Frank Hwang, editors, Computing in Euclidean Geometry, pages 193--233. World Scientific, 1992.
Interval Arithmetic Yields Efficient Dynamic Filters.. - Brönnimann, Burnikel.. (1998) (Correct)
No context found.
S. Fortune, Voronoi diagrams and Delaunay triangulations, in: D.-Z. Du and F. K. Hwang, eds., Computing in Euclidean Geometry, volume 1 (Lecture Notes Series on Computing, World Scientific, Singapore, 1992) 225--265.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC