scientific article; zbMATH DE number 219238
From MaRDI portal
Publication:4694724
zbMATH Open0789.68141MaRDI QIDQ4694724FDOQ4694724
Authors: Joseph S. B. Mitchell, Thomas Roos, Leonidas Guibas
Publication date: 29 June 1993
Title of this publication is not available (Why is that?)
Recommendations
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cited In (34)
- Title not available (Why is that?)
- Voronoi diagrams of moving points in the plane and of lines in space: tight bounds for simple configurations
- A Methodology for Automated Cartographic Data Input, Drawing and Editing Using Kinetic Delaunay/Voronoi Diagrams
- Ready, set, go! The Voronoi diagram of moving points that start from a line
- A Laguerre Voronoi based scheme for meshing particle systems
- Voronoi diagrams of rigidly moving sets of points
- Title not available (Why is that?)
- Cross-sections of line configurations in \(\mathbb{R}^3\) and (\(d-2\))-flat configurations in \(\mathbb{R}^d\)
- Kinetic Voronoi diagrams and Delaunay triangulations under polygonal distance functions
- Kinetic Geodesic Voronoi Diagrams in a Simple Polygon
- Swap conditions for dynamic Voronoi diagrams for circles and line segments
- PROBABILISTIC ANALYSIS FOR DISCRETE ATTRIBUTES OF MOVING POINTS
- Voronoi Diagrams of Moving Points
- A simple, faster method for kinetic proximity problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Kinetic Euclidean minimum spanning tree in the plane
- Maintaining proximity in higher dimensional spaces (extended abstract)
- Title not available (Why is that?)
- Dynamic maintenance and visualization of molecular surfaces.
- Shortest path problems on a polyhedral surface
- A kinetic triangulation scheme for moving points in the plane
- Arrangements in higher dimensions: Voronoi diagrams, motion planning, and other applications
- On kinetic Delaunay triangulations: a near-quadratic bound for unit speed motions
- Nonuniform SINR+Voronoi diagrams are effectively uniform
- Stable Delaunay graphs
- Structural tolerance and Delaunay triangulation
- On minimum and maximum spanning trees of linearly moving points
- Almost tight upper bounds for lower envelopes in higher dimensions
- Voronoi diagrams of moving points in higher dimensional spaces
- Queries on Voronoi diagrams on moving points
- GPU based detection of topological changes in Voronoi diagrams
- Near-quadratic bounds for the \(L_ 1\) Voronoi diagram of moving points
- Closest pair and the post office problem for stochastic points
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4694724)