Zhenming Chen, Jinhui Xu  Home/Search
Context
Related
| cccg.ca/proceedings/2002/24new.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cccg.ca/proceedings/2002/index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper, we investigate the robustness of a plane sweep algorithm for constructing the Voronoi diagram of a set of non-crossing line segments in 2-dimensional space using a distance metric induced by a regular k- gon. Based on the degree model [13], we show that the Voronoi diagram of a set of arbitrarily oriented segments can be constructed with degree 14 under certain k-gon metrics (e.g. k = 6; 8; 12). For some restricted inputs, the degree is reduced to 2. The algorithm is easy to be... (Update)
Active bibliography (related documents): More All
2.0: Robustness of Algorithm for k-Gon Voronoi Diagram Construction - Chen, Papadopoulou, Xu (Correct)
0.5: A Coarse Grained Parallel Algorithm - For Hausdorff Voronoi (Correct)
0.3: On Geometric Path Query Problems - Chen, Daescu, Klenk (1997) (Correct)
Similar documents based on text: More All
0.2: An Efficient Direct Approach for Computing Shortest Rectilinear.. - Chen, Xu (1998) (Correct)
0.2: Optimizing the Sum of Linear Fractional Functions and.. - Chen, Daescu, Dai.. (Correct)
0.1: Variations on Sweep Algorithms: efficient computation of.. - van Kreveld (1996) (Correct)
BibTeX entry: (Update)
@misc{ chen-robustness,
author = "Zhenming Chen and Jinhui Xu",
title = "Robustness of Algorithm for k-Gon Voronoi Diagram Construction",
url = "citeseer.ist.psu.edu/article/chen02robustness.html" }
Citations (may not include all citations):1254 Computational Geometry - An Introduction (context) - Preparata, Shamos - 1985
257 Voronoi Diagrams|A Survey of a Fundamental Geometric Data St.. (context) - Aurenhammer - 1991
229 Computational Geometry: Algorithms and Applications (context) - de Berg, van Kreveld et al. - 2000
159 A Sweepline Algorithm for Voronoi Diagrams (context) - Fortune - 1987
51 Voronoi diagrams based on convex distance functions (context) - Chew, Drysdale - 1985
41 How to Compute the Voronoi Diagram of Line Segments: Theoret.. (context) - Burnikel, Mehlhorn et al. - 1994
38 Robust Proximity Queries: An illustration of degreedriven al.. - Liotta, Preparata et al. - 1998
37 Concrete and Abstract Voronoi Diagrams (context) - Klein - 1989
25 Exact Computation of Voronoi Diagrams and Line Segment Inter.. (context) - Burnikel - 1996
22 A Compact Piecewise-Linear Voronoi Diagram for Convex Sites .. - McAllister, Kirkpatrick et al. - 1996
21 A Core Library For Robust Numeric and Geometric Computation - Karamcheti, Li et al. - 1999
18 Robust Proximity Queries in Implicit Voronoi Diagrams - Liotta, Preparata et al. - 1996
16 Voronoi diagrams based on general metrics in the plane (context) - Klein, Wood - 1988
13 Hierarchical Steiner Tree Construction in Uniform Orientatio.. (context) - Sarrafzadeh, Wong - 1992
8 Critical Area Computation via Voronoi Diagram (context) - Papadopoulou, Lee - 1999
7 Handbook of Computational Geometry (context) - Aurenhammer, Klein et al. - 2000
4 The Big Sweep: On the Power of the Wavefront Approach to Vor.. - Dehne, Klein - 1997
4 Voronoi Diagram and Applications to VLSI Layout and Manufact.. (context) - Papadopoulou, Lee - 2001
3 On some distance problems in xed orientations (context) - Widmayer, Wu et al. - 1987
2 Towards Robust Geometric Computation (context) - Yap, Mehlhorn
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