Constructing levels in arrangements and higher order Voronoi diagrams

No abstract is available for this paper.

• Publication year

  1994

• Venue

  SCG '94

• Publication date

  1994-06-10

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1145/177424.177521
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Separating two simple polygons by a sequence of translations

  2015cited by this paper
• On the general motion-planning problem with two degrees of freedom

  2015cited by this paper
• On lazy randomized incremental construction

  1994cited by this paper
• Computing many faces in arrangements of lines and segments

  1994cited by this paper
• An optimal algorithm for the (≤ k)-levels, with applications to separation and transversal problems

  1993cited by this paper
• Computational geometry - an introduction through randomized algorithms

  1993cited by this paper
• Cutting hyperplanes for divide-and-conquer

  1993cited by this paper
• Counting triangle crossings and halving planes

  1993cited by this paper
• The Colored Tverberg's Problem and Complexes of Injective Functions

  1992cited by this paper
• An upper bound on the number of planarK-sets

  1992cited by this paper
• A fast planar partition algorithm, II

  1991cited by this paper
• A simple on-line randomized incremental algorithm for computing higher order Voronoi diagrams

  1991cited by this paper
• Computing a face in an arrangement of line segments

  1991cited by this paper
• On levels in arrangements and voronoi diagrams

  1991cited by this paper
• Cutting hyperplane arrangements

  1990cited by this paper
• Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences

  1989cited by this paper
• An upper bound on the number of planar k-sets

  1989cited by this paper
• A fast planar partition algorithm, II

  1989cited by this paper
• Applications of random sampling in computational geometry, II

  1988cited by this paper
• A deterministic view of random sampling and its use in geometry

  1988cited by this paper
• A fast planar partition algorithm. I

  1988cited by this paper
• A Randomized Algorithm for Closest-Point Queries

  1988cited by this paper
• Algorithms in Combinatorial Geometry

  1987cited by this paper
• ɛ-nets and simplex range queries

  1987cited by this paper
• An Improved Algorithm for Constructing k th-Order Voronoi Diagrams

  1987cited by this paper
• New applications of random sampling in computational geometry

  1987cited by this paper
• Constructing Belts in Two-Dimensional Arrangements with Applications

  1986cited by this paper
• Epsilon-nets and simplex range queries

  1986cited by this paper
• An Improved Algorithm for Constructing kth-Order Voronoi Diagrams

  1985cited by this paper
• On k-hulls and related problems

  1984cited by this paper
• Dissection Graphs of Planar Point Sets

  1973cited by this paper
• Combinatorics, Probability and Computing Point Selections and Weak Ε-nets for Convex Hulls Point Selections and Weak E-nets for Convex Hulls

  year unknowncited by this paper

• Higher-Order Color Voronoi Diagrams and the Colorful Clarkson-Shor Framework

  2025cites this paper
• Efficient Direct-Access Ranked Retrieval

  2025cites this paper
• Finding a Fair Scoring Function for Top-$k$ Selection: From Hardness to Practice

  2025influential citation
• SensorBFT: Fault-Tolerant Target Localization Using Voronoi Diagrams and Approximate Agreement

  2024cites this paper
• Mining the Minoria: Unknown, Under-represented, and Under-performing Minority Groups

  2024cites this paper
• Unbounded Regions of High-Order Voronoi Diagrams of Lines and Line Segments in Higher Dimensions

  2023cites this paper
• An Optimal Algorithm for Higher-Order Voronoi Diagrams in the Plane: The Usefulness of Nondeterminism

  2023influential citation
• Dot to dot, simple or sophisticated: a survey on shape reconstruction algorithms

  2023cites this paper
• Bypass Exponential Time Preprocessing: Fast Neural Network Training via Weight-Data Correlation Preprocessing

  2022cites this paper
• Data-Centric Distrust Quantification for Responsible AI: When Data-driven Outcomes Are Not Reliable

  2022cites this paper
• On Finding Rank Regret Representatives

  2022cites this paper
• Bottleneck Matching in the Plane

  2022cites this paper
• T-LevelIndex: Towards Efficient Query Processing in Continuous Preference Space

  2022influential citation
• Reliability evaluation of individual predictions: a data-centric approach

  2022cites this paper
• Data-centric Reliability Evaluation of Individual Predictions

  2022cites this paper
• The edge labeling of higher order Voronoi diagrams

  2021cites this paper
• Voronoi Diagrams

  2021cites this paper
• Identifying Insufficient Data Coverage for Ordinal Continuous-Valued Attributes

  2021cites this paper
• Does Preprocessing Help Training Over-parameterized Neural Networks?

  2021cites this paper
• Covering geometric domains

  2021cites this paper
• Complete Classification and Efficient Determination of Arrangements Formed by Two Ellipsoids

  2020cites this paper
• Voronoier: from images to Voronoi diagrams

  2020cites this paper
• A Simple Algorithm for Higher-Order Delaunay Mosaics and Alpha Shapes

  2020cites this paper
• Distributed Coverage Control of Multi-Agent System in Convective–Diffusive Time Evolving Environments

  2019cites this paper
• Higher order mobile coverage control with applications to clustering of discrete sets

  2019cites this paper
• University of Groningen Visualization of Generalized Voronoi Diagrams

  2019cites this paper
• A Simple Algorithm for Computing Higher Order Delaunay Mosaics

  2019cites this paper
• Unbounded Regions of High-Order Voronoi Diagrams of Lines and Segments in Higher Dimensions

  2019cites this paper
• Cost optimization based on influence and user preference

  2019cites this paper
• Exact Processing of Uncertain Top-k Queries in Multi-criteria Settings

  2018cites this paper
• Location Problems with k-max Functions - Modelling and Analysing Outliers in Center Problems

  2018cites this paper
• Assigning Weights to Minimize the Covering Radius in the Plane

  2018cites this paper
• Nearly Optimal Planar k Nearest Neighbors Queries under General Distance Functions

  2018cites this paper
• On k Nearest Neighbor Queries in the Plane for General Distance Functions

  2018cites this paper
• An Efficient Randomized Algorithm for Higher-Order Abstract Voronoi Diagrams

  2018cites this paper
• Highest order Voronoi diagram optimization

  2017cites this paper
• Computable, robust multivariate location using integrated univariate ranks

  2017influential citation
• Higher order mobile coverage control with application to localization

  2017cites this paper
• Improved Time-Space Trade-offs for Computing Voronoi Diagrams

  2017cites this paper
• On the arrangement of stochastic lines in ℤ2

  2017cites this paper
• Dynamic Planar Voronoi Diagrams for General Distance Functions and Their Algorithmic Applications

  2016cites this paper
• Leveraging Client Processing for Location Privacy in Mobile Local Search

  2016cites this paper
• 28 Arrangements

  2016cites this paper
• k-Nearest neighbors tracking in wireless sensor networks with coverage holes

  2016cites this paper
• Influence based cost optimization on user preference

  2016cites this paper
• Nearest-Neighbor Searching Under Uncertainty II

  2016cites this paper
• A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams

  2016cites this paper
• Geometric Computing over Uncertain Data

  2015cites this paper
• The k-Nearest-Neighbor Voronoi Diagram Revisited

  2015influential citation
• K-Nearest Neighbor Query Processing

  2015cites this paper
• Secure Query Processing Using Open Source GMAP of API

  2015cites this paper
• CUT DETECTION DUE TO ENERGY FAILURE IN WIRELESS SENSOR NETWORK USING CLUSTER BASED APPROACH

  2015cites this paper
• Literature study on k-nearest neighbor query processing

  2015cites this paper
• Higher-order Voronoi diagrams of polygonal objects

  2014influential citation
• Transforming rectangles into squares

  2014cites this paper
• A Unified Framework for Efficiently Processing Ranking Related Queries

  2014cites this paper
• Higher order Voronoi based mobile coverage control

  2014cites this paper
• The Higher-Order Voronoi Diagram of Line Segments

  2014cites this paper
• Exploiting Service Similarity for Privacy in Location-Based Search Queries

  2014cites this paper
• Transforming rectangles into squares An introduction to the squarability problem Bachelor

  2014cites this paper
• Secure kNN Query Processing in Untrusted Cloud Environments

  2014cites this paper
• Order-k α-hulls and α-shapes

  2014cites this paper
• A Randomized Divide and Conquer Algorithm for Higher-Order Abstract Voronoi Diagrams

  2014cites this paper
• Nearest neighbor searching under uncertainty II

  2013cites this paper
• Sphere Packings for Arbitrary Objects

  2013cites this paper
• Higher-Order Geodesic Voronoi Diagrams in a Polygonal Domain with Holes

  2013cites this paper
• A Sweepline Algorithm for Higher Order Voronoi Diagrams

  2013cites this paper
• Covering a bichromatic point set with two disjoint monochromatic disks

  2013cites this paper
• Output-Sensitive Tools for Range Searching in Higher Dimensions

  2013cites this paper
• On k-Enclosing Objects in a Coloured Point Set

  2013cites this paper
• Nearest-neighbor searching under uncertainty

  2012cites this paper
• On the order-k Voronoi diagram of line segments

  2012cites this paper
• Higher Order City Voronoi Diagrams

  2012cites this paper
• On Higher Order Voronoi Diagrams of Line Segments

  2012cites this paper
• Centroid Triangulations from k-Sets

  2011cites this paper
• Multi Cover of a Polygon Minimizing the Sum of Areas

  2011cites this paper
• An Output-Sensitive Approach for the L 1/L ∞ k-Nearest-Neighbor Voronoi Diagram

  2011cites this paper
• Location modeling utilizing closest and generalized closest transport/interaction assignment constructs

  2010cites this paper
• Obstacle discovery in distributed actuator and sensor networks

  2010cites this paper
• Obstacle Discovery in Distributed Active Sensor Networks

  2009cites this paper
• Near-Linear Approximation Algorithms for Geometric Hitting Sets

  2009cites this paper
• Higher Order Voronoi Diagrams and Distance Functions in Art and Visualization

  2008cites this paper
• Detecting Commuting Patterns by Clustering Subtrajectories

  2008cites this paper
• Construction of the segment Delaunay triangulation by a flip algorithm (Construction de la triangulation de Delaunay de segments par un algorithme de flip)

  2008cites this paper
• Computing closest and farthest points for a query segment

  2008cites this paper
• High Order Voronoi Sculpture

  2007cites this paper
• k-Sets and k-Facets

  2007cites this paper
• E cient Searching with Linear Constraints ( Extended Abstract )

  2007cites this paper
• Composite Models for Mobile Robot Offline Path Planning

  2007cites this paper
• Computational Geometry Ii

  2007cites this paper
• Region-restricted clustering for geographic data mining

  2006cites this paper
• Relative ε-Approximations in Geometry ∗

  2006cites this paper
• Skeletonization and Distance Transforms of 3D Volumes Using Graphics Hardware

  2006cites this paper
• Using Line and Texture to Visualize Higher-Order Voronoi Diagrams

  2006cites this paper
• Combinatorial Geometry with Algorithmic Applications

  2006cites this paper
• Euclidean push-pull partial covering problems

  2006cites this paper
• Staying in the Middle: Exact and Approximate Medians in R1 and R2 for Moving Points

  2005cites this paper
• Constructing higher-order Voronoi diagrams in parallel

  2005cites this paper
• Detecting cuts in sensor networks

  2005cites this paper
• The interface between computational and combinatorial geometry

  2005cites this paper