K. Q. Brown. Voronoi diagrams from convex hulls. Inform. Process. Lett. 9(5), 223--228, 1979.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... [14] to construct the Voronoi diagram of circular arcs (not necessarily geodesic) on the sphere, as a spherical analog of the method by Alt and Schwarzkopf [1] Brown s most important discovery, however, is arguably the connection between 3 dimensional convex hulls and planar Voronoi diagrams [4, 5]. Let L be a set of points on the sphere, and consider a stereographic projection mapping the sphere to a plane. Let V be the resulting set of points in the plane. Brown showed that the Voronoi diagram of V (in the plane) has the same combinatorial structure as that part of the convex hull of L ....

K. Q. Brown. Voronoi diagrams from convex hulls. Information Processing Letters 9 (1979), pp. 223-228.

....hull of a set of points is dual to the intersection of a set of half spaces. Geometric transformations can use spaces of different dimensions : H. Edelsbrunner and F. Aurenhammer (and others) have worked a lot on results obtained owing to geometric transformations in Computational Geometry (see [Bro79] who has applied this tool to Voronoi diagram for the first time, ES86] and [Aur91] for a survey) Their approach is as follows : if we take the unit paraboloid in IE of equation ( Pi) x d 1 = x 1 x 2 : x then the intersection between Pi and the dual hyperplane p of a point ....

....The number of sites interior to the sphere is the number of associated hyperplanes in the arrangement, that pass above this intersecting point. More generally, we get : The order k Voronoi diagram of S is dual to the k level of the arrangement of the hyperplanes dual to the sites of S. In [Bro79] K.Q. Brown proved the duality between Voronoi diagram and convex hull, using inversions. In [ES86, Aur91] the proofs of such properties where purely analytic. We propose in [DMT92] a much more geometric interpretation, that avoids all calculations (see also [BCDT91] We now give a quick clue ....

K.Q. Brown. Voronoi diagrams from convex hulls. Information Processing Letters, 9:223--228, 1979.

....(for example [4, 39] compete with divide and conquer algorithms (for example [8,42] Newer research studies randomization [41] One approach uses a lifting map (see below) to transform the triangulation problem in R to the problem of constructing the convex hull in R . This idea goes back to [7]; details on the con structions of convex hulls in d dimensions can be found in [21] Another approach is based on local transformations or flips [28,46,52] A variant of this method will be discussed in section 4.1 of this thesis. Lifting map. Identify 3 with the xlx2x3 space in 4, that is, ....

K Q Brown. Voronoi diagrams from convex hulls. Information Processing Letters, 9(5):223 228, 1979.

....d . The space of M obius transformations is generated by inversions. Examples include re ections, rotations, translations, dilations, and the well known stereographic lifting map from c R d to S d R d 1 relating d dimensional Delaunay triangulations to (d 1) dimensional convex hulls [13]. M obius transformations are conformal, meaning they locally preserve angles. There are many other conformal maps in the plane in fact, conformal maps are widely used in two dimensional mesh generation algorithms but M obius transformations are the only continuous conformal maps in dimensions ....

K. Q. Brown. Voronoi diagrams from convex hulls. Inform. Process. Lett. 9(5):223-228, 1979.

....about looking at extra buckets. The advantages of our scheme are that it is well tuned to the case when sites are distributed in the unit square and it avoids the extra overhead of managing a priority queue, especially avoiding duplicate insertions. 1.6. Convex Hull Based Algorithms Brown [6] was the first to establish a connection between Voronoi diagrams in dimension d and convex hulls in dimension d 1. Edelsbrunner and Seidel [10] later found a correspondence between Delaunay triangles of a set of sites in dimension 2 and downward facing faces of the convex hull of those sites ....

K. Brown. Voronoi diagrams from convex hulls. IPL, pages 223--228, 1979.

.... Inserting or deleting the solid point changes the farthest point Voronoi diagram (solid and dashed lines) we maintain the convex hulls of the points in each Voronoi region (dotted lines) Proof: Since the farthest point Delaunay triangulation is the projection of a three dimensional convex hull [10], we can maintain it using Mulmuley s dynamic convex hull algorithm [31] The Voronoi diagram is dual to the Delaunay triangulation, so each change in the Voronoi diagram can be found from a corresponding change in the Delaunay triangulation. # Along with the farthest point Voronoi diagram ....

K. Q. Brown. Voronoi diagrams from convex hulls. Inform. Proc. Lett., 9:223--226, 1979.

.... the maximum smallest enclosing circle [D AS89, Raj91] Efficient algorithms for constructing Delaunay triangulations are abundant in the literature and based on such diverse algorithmic paradigms as edge flipping [Laws72, Laws77] divide and conquer [ShHo75, GuSt85] geometric transformation [Brow79], plane sweep [For87] and randomized incrementation [GuKS90] Recently, Edelsbrunner, Tan, and Waupotitsch devised a polynomial time algorithm that minimizes the maximum angle [EdTW92] This algorithm constructs a minmax angle triangulation by iteratively inserting a new edge, removing old edges ....

K. Q. Brown. Voronoi diagrams from convex hulls. Inform. Process. Lett. 9 (1979), 223-- 228.

....by determining the region in the farthest point Voronoi diagram containing that point. Lemma 8. We can maintain the farthest point Voronoi diagram in expected time O(log n) per update. 8 Proof: Since the farthest point Delaunay triangulation is the projection of a three dimensional convex hull [8], we can maintain it using Mulmuley s dynamic convex hull algorithm [26] The Voronoi diagram is dual to the Delaunay triangulation, so each change in the Voronoi diagram can be found from a corresponding change in the Delaunay triangulation. # Along with the farthest point Voronoi diagram ....

K. Q. Brown. Voronoi diagrams from convex hulls. Inform. Proc. Lett., 9:223--226, 1979.

....by determining the region in the farthest point Voronoi diagram containing that point. Lemma 4.1. We can maintain the farthest point Voronoi diagram in expected time O(log n) per update. Proof. Since the farthest point Delaunay triangulation is the projection of a three dimensional convex hull [9], we can maintain it using Mulmuley s dynamic convex hull algorithm [23] The Voronoi diagram is dual to the Delaunay triangulation, so each change in the Voronoi diagram can be found from a corresponding change in the Delaunay triangulation. # Along with the farthest point Voronoi diagram ....

K. Q. Brown. Voronoi diagrams from convex hulls. Inform. Proc. Lett., 9:223--226, 1979.

.... and the minimum integral of the gradient squared [Rip90] Efficient algorithms for constructing Delaunay triangulations are abundant in the literature and based on such diverse algorithmic paradigms as edge flipping [Laws72, Laws77] divide andconquer [ShHo75, GuSt85] geometric transformation [Brow79], plane sweep [For87] and randomized incrementation [GuKS90] Recently, polynomial time algorithms have also been found for the minmax angle and the minmax edge length criteria [EdTW92, EdTa91] The method of [EdTW92] is most relevant to this paper. It constructs a minmax angle triangulation by ....

K. Q. Brown. Voronoi diagrams from convex hulls. Inform. Process. Lett. 9 (1979), 223-- 228.

....triangulations; it is related to many positive results known in the area. Besides the O(n 2 ) time edge flip method (Section 2. 3) Delaunay triangulation can be computed in Theta(n log n) time by diverse algorithmic paradigms such as divide and conquer [GuSt85, ShHo75] geometric transformation [Brow79], and plane sweep [Fort87] Furthermore, it can be computed in time O(n log n) with high probability by randomized incrementation [GKS92] Among all triangulations of a given point set S, the Delaunay triangulation optimizes criteria such as the max min angle [Sibs78] the min max circumscribed ....

K. Q. Brown. Voronoi diagrams from convex hulls. Inform. Process. Lett. 9 (1979), 223--228.

....Delaunay triangulation in R d can be computed from a convex hull in R d 1 . To determine the Delaunay triangulation of a set of points: lift the points to a paraboloid and compute their convex hull. The set of ridges of the lower convex hull is the Delaunay triangulation of the original points [Brown 1979]. The intersection of halfspaces about the origin is equivalent to the convex hull of the points in dual space [Preparata and Shamos 1985] To determine the intersection of halfspaces: locate an interior point by linear programming [Teller 1994] translate the interior point to the origin, ....

....for Delaunay triangulations. They express their algorithm in terms of triangulations and the in sphere test. By the correspondence between Delaunay triangulation and convex hull, each triangle is a facet of the convex hull and the in sphere test determines the visible facets for the lifted point [Brown 1979]. 3. COMPARISON OF QUICKHULL WITH THE RANDOMIZED ALGORITHMS If Quickhull and the randomized algorithms perform essentially the same steps, why do we prefer Quickhull Quickhull uses less space than most of the randomized incremental algorithms and runs faster for distributions with non extreme ....

Brown, D. 1979. Voronoi diagrams from convex hulls. Information Processing Letters 9, 223--228.

No context found.

K. Q. Brown. Voronoi diagrams from convex hulls. Inform. Process. Lett. 9(5), 223--228, 1979.

No context found.

K. Q. Brown. Voronoi diagrams from convex hulls. Inform. Process. Lett., 9(5):223--228, 1979.

No context found.

K. Q. Brown. Voronoi diagrams from convex hulls. Inf. Process. Lett. 9 (5), pages 223--228, 1979.

No context found.

K. Q. Brown. Voronoi diagrams from convex hulls. Inform. Process. Lett. 9(5), 223--228, 1979.

No context found.

K. Q. Brown. Voronoi diagrams from convex hulls. IPL, 9:223-228, 1979.

No context found.

K. Q. Brown. Voronoi diagrams from convex hulls. Inf. Process. Lett. 9 (5), pages 223--228, 1979.

No context found.

K. Q. Brown. Voronoi diagrams from convex hulls. Inform. Process. Lett. 9(5), 223--228, 1979.

No context found.

K. Q. Brown. Voronoi diagrams from convex hulls. Inf. Process. Lett. 9 (5), pages 223--228, 1979.

No context found.

K. Q. Brown. Voronoi diagrams from convex hulls. Inf. Process. Lett. 9 (5), pages 223--228, 1979.

No context found.

K. Q. Brown. Voronoi Diagrams from Convex Hulls. Information Processing Letters 9:223--228, 1979.

No context found.

K. Q. Brown. Voronoi diagrams from convex hulls. Inform. Process. Lett. 9(5), 223--228, 1979.

No context found.

K.Q. Brown. Voronoi Diagrams from Convex Hulls. Information Processing Letters, Vol. 9, pages 223-- 228, 1979.

No context found.

K.Q. Brown, "Voronoi diagrams from convex hulls", Information Processing Letters, 9(5):223 -- 228, 1979.

First 50 documents

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