scientific article; zbMATH DE number 1182913
From MaRDI portal
Publication:4401010
zbMath0907.68190MaRDI QIDQ4401010
Publication date: 2 August 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (46)
Higher order Delaunay triangulations ⋮ Continuous amortization and extensions: with applications to bisection-based root isolation ⋮ Abstract Voronoi diagrams revisited ⋮ Numerical studies of MacQueen's \(k\)-means algorithm for computing the centroidal Voronoi tessellations ⋮ Fundamental groups of links of isolated singularities ⋮ The visibility-Voronoi complex and its applications ⋮ Stable marker-particle method for the Voronoi diagram in a flow field ⋮ An \(O(mn^ 2)\) algorithm for the maximin problem in \(E^ 2\) ⋮ Dynamics and limiting behavior of Julia sets of König's method for multiple roots ⋮ Simulated evolution of selfish herd behavior ⋮ Triangulations from topologically correct digital Voronoi diagrams ⋮ Forest-like abstract Voronoi diagrams in linear time ⋮ A faster circle-sweep Delaunay triangulation algorithm ⋮ Interior boundary-aligned unstructured grid generation and cell-centered versus vertex-centered CVD-MPFA performance ⋮ Efficient mesh optimization schemes based on optimal Delaunay triangulations ⋮ A control problem for affine dynamical systems on a full-dimensional polytope. ⋮ Alexandrov's theorem, weighted Delaunay triangulations, and mixed volumes ⋮ Image categorization: Graph edit distance \(+\) edge direction histogram ⋮ Approximating the maxmin-angle covering triangulation ⋮ Computability of Partial Delaunay Triangulation and Voronoi Diagram [Extended Abstract] ⋮ Interval arithmetic yields efficient dynamic filters for computational geometry ⋮ Numerical investigation of the effect of non-local plasticity on surface roughening in metals ⋮ Witness (Delaunay) graphs ⋮ Bounds for the CRDT conformal mapping algorithm ⋮ VRONI: An engineering approach to the reliable and efficient computation of Voronoi diagrams of points and line segments ⋮ Kinetic and dynamic Delaunay tetrahedralizations in three dimensions ⋮ 2D and 3D finite element meshing and remeshing ⋮ Three-dimensional unstructured gridding for complex wells and geological features in subsurface reservoirs, with CVD-MPFA discretization performance ⋮ Kernel interpolation ⋮ Integer convex minimization by mixed integer linear optimization ⋮ Note on the complexity of the mixed-integer hull of a polyhedron ⋮ Sequences of spanning trees and a fixed tree theorem ⋮ Computing Voronoi skeletons of a 3-D polyhedron by space subdivision ⋮ Conformal mapping in linear time ⋮ Predictive control for hybrid systems. Implications of polyhedral pre-computations ⋮ Temporally coherent general dynamic scene reconstruction ⋮ The Voronoi diagram of three lines ⋮ Computing the topology of Voronoï diagrams of parallel half-lines ⋮ The geometry of Minkowski spaces -- a survey. II. ⋮ A lower bound on Voronoi diagram complexity. ⋮ On local transformation of polygons with visibility properties. ⋮ Grid generation and optimization based on centroidal Voronoi tessellations ⋮ Improving continuity of Voronoi-based interpolation over Delaunay spheres ⋮ On optimal bridges between two convex regions ⋮ On the complexity of higher order abstract Voronoi diagrams ⋮ A sausage heuristic for Steiner minimal trees in three-dimensional Euclidean space
Uses Software
This page was built for publication:
