scientific article; zbMATH DE number 1182913
From MaRDI portal
Publication:4401010
zbMATH Open0907.68190MaRDI QIDQ4401010FDOQ4401010
Authors: Steven Fortune 
Publication date: 2 August 1998
Title of this publication is not available (Why is that?)
Recommendations
Cited In (63)
- On optimal bridges between two convex regions
- Voronoi diagrams, triangulations and surfaces
- Fundamental groups of links of isolated singularities
- On the complexity of higher order abstract Voronoi diagrams
- On local transformation of polygons with visibility properties.
- Duality of constrained Voronoi diagrams and Delaunay triangulations
- Bounds for the CRDT conformal mapping algorithm
- Voronoi diagrams on piecewise flat surfaces and an application to biological growth
- Note on the complexity of the mixed-integer hull of a polyhedron
- Computability of partial Delaunay triangulation and Voronoi diagram (extended abstract)
- Abstract Voronoi diagrams revisited
- Continuous amortization and extensions: with applications to bisection-based root isolation
- The visibility-Voronoi complex and its applications
- A faster circle-sweep Delaunay triangulation algorithm
- Image categorization: Graph edit distance \(+\) edge direction histogram
- Voronoi diagrams and arrangements
- Numerical investigation of the effect of non-local plasticity on surface roughening in metals
- A control problem for affine dynamical systems on a full-dimensional polytope.
- A lower bound on Voronoi diagram complexity.
- Numerical studies of MacQueen's \(k\)-means algorithm for computing the centroidal Voronoi tessellations
- Interval arithmetic yields efficient dynamic filters for computational geometry
- Stable marker-particle method for the Voronoi diagram in a flow field
- Three-dimensional unstructured gridding for complex wells and geological features in subsurface reservoirs, with CVD-MPFA discretization performance
- Voronoi polygons and polyhedra
- Predictive control for hybrid systems. Implications of polyhedral pre-computations
- Higher order Delaunay triangulations
- An \(O(mn^ 2)\) algorithm for the maximin problem in \(E^ 2\)
- Conformal mapping in linear time
- Kernel interpolation
- Computing Voronoi skeletons of a 3-D polyhedron by space subdivision
- Title not available (Why is that?)
- Alexandrov's theorem, weighted Delaunay triangulations, and mixed volumes
- Kinetic and dynamic Delaunay tetrahedralizations in three dimensions
- Title not available (Why is that?)
- A new approach to output-sensitive construction of Voronoi diagrams and Delaunay triangulations
- Improving continuity of Voronoi-based interpolation over Delaunay spheres
- The Voronoi diagram of three lines
- The geometry of Minkowski spaces -- a survey. II.
- Triangulations from topologically correct digital Voronoi diagrams
- Temporally coherent general dynamic scene reconstruction
- A sausage heuristic for Steiner minimal trees in three-dimensional Euclidean space
- Dynamics and limiting behavior of Julia sets of König's method for multiple roots
- Computing the topology of Voronoï diagrams of parallel half-lines
- Grid generation and optimization based on centroidal Voronoi tessellations
- Integer convex minimization by mixed integer linear optimization
- VRONI: An engineering approach to the reliable and efficient computation of Voronoi diagrams of points and line segments
- Efficient mesh optimization schemes based on optimal Delaunay triangulations
- Voronoi diagrams and Delaunay triangulations: ubiquitous siamese twins
- Sequences of spanning trees and a fixed tree theorem
- Witness (Delaunay) graphs
- 2D and 3D finite element meshing and remeshing. A bibliography (1990-2001)
- On Voronoi diagrams and medial axes
- Forest-like abstract Voronoi diagrams in linear time
- Simulated evolution of selfish herd behavior
- Voronoi diagrams on the sphere
- Quasi-worlds and quasi-operators on quasi-triangulations
- Delaunay configurations and multivariate splines: A generalization of a result of B. N. Delaunay
- Interior boundary-aligned unstructured grid generation and cell-centered versus vertex-centered CVD-MPFA performance
- Approximating the maxmin-angle covering triangulation
- Generalised heat kernel invariants of a graph and application to object clustering
- On the Triangle-Perimeter Two-Site Voronoi Diagram
- Title not available (Why is that?)
- Title not available (Why is that?)
Uses Software
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 Q4401010)
