The one-dimensional weighted Voronoi diagram
From MaRDI portal
Publication:1071508
DOI10.1016/0020-0190(86)90055-4zbMATH Open0586.68036OpenAlexW2005915375MaRDI QIDQ1071508FDOQ1071508
Authors: Franz Aurenhammer 
Publication date: 1986
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(86)90055-4
Recommendations
Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)
Cites Work
- Stabbing line segments
- Two-Dimensional Voronoi Diagrams in the L p -Metric
- Power Diagrams: Properties, Algorithms and Applications
- Plane-sweep algorithms for intersecting geometric figures
- Title not available (Why is that?)
- An optimal algorithm for constructing the weighted Voronoi diagram in the plane
- Generalization of Voronoi Diagrams in the Plane
- Dynamization of order decomposable set problems
Cited In (9)
- Connecting red cells in a bicolour Voronoi diagram
- Generalized Dirichlet tesselations
- Title not available (Why is that?)
- Fast Voronoi modeling
- An optimal algorithm for constructing the weighted Voronoi diagram in the plane
- An Efficient, Practical Algorithm and Implementation for Computing Multiplicatively Weighted Voronoi Diagrams
- The onion diagram: a Voronoi-like tessellation of a planar line space and its applications (extended abstract)
- The onion diagram: a Voronoi-like tessellation of a planar line space and its applications
- Weighted Voronoi diagrams in the maximum norm
This page was built for publication: The one-dimensional weighted Voronoi diagram
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1071508)
