Voronoi

swMATH21795MaRDI QIDQ33596FDOQ33596

Author name not available (Why is that?)

Official website: http://ect.bell-labs.com/who/sjf/

Cited In (only showing first 100 items - show all)

• On optimal bridges between two convex regions
• Boat-sail Voronoi diagram and its computation based on a cone-approximation scheme
• On local transformation of polygons with visibility properties.
• Bounds for the CRDT conformal mapping algorithm
• On shape Delaunay tessellations
• Pre-triangulations and liftable complexes
• Three-dimensional unstructured gridding for complex wells and geological features in subsurface reservoirs, with CVD-MPFA discretization performance
• IAN: Iterated Adaptive Neighborhoods for Manifold Learning and Dimensionality Estimation
• Connecting colored point sets
• Voronoi Diagrams for Parallel Halflines and Line Segments in Space
• Predictive control for hybrid systems. Implications of polyhedral pre-computations
• An \(O(mn^ 2)\) algorithm for the maximin problem in \(E^ 2\)
• Kernel interpolation
• Computing Voronoi skeletons of a 3-D polyhedron by space subdivision
• Triangulations with Circular Arcs
• The Voronoi diagram of three lines
• Boat-sail Voronoi diagram on a curved surface
• Triangulations from topologically correct digital Voronoi diagrams
• Temporally coherent general dynamic scene reconstruction
• Round-trip Voronoi diagrams and doubling density in geographic networks
• 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
• Integer convex minimization by mixed integer linear optimization
• Robustly computing restricted Voronoi diagrams (RVD) on thin-plate models
• Triangulations with Circular Arcs
• 2D and 3D finite element meshing and remeshing. A bibliography (1990-2001)
• Forest-like abstract Voronoi diagrams in linear time
• Interior boundary-aligned unstructured grid generation and cell-centered versus vertex-centered CVD-MPFA performance
• An optimal algorithm for computing visible nearest foreign neighbors among colored line segments
• Computation of spatial skyline points
• The Delaunay triangulation learner and its ensembles
• Metric combinatorics of convex polyhedra: cut loci and nonoverlapping unfoldings
• Fundamental groups of links of isolated singularities
• A note on visibility-constrained Voronoi diagrams
• On the complexity of higher order abstract Voronoi diagrams
• Title not available (Why is that?)
• General-dimensional constrained Delaunay and constrained regular triangulations. I: Combinatorial properties
• 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
• Index structures for fast similarity search for real vectors. II
• 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.
• Coverage and exposure paths in wireless sensor networks
• 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
• Higher order Delaunay triangulations
• Sign determination in residue number systems
• Pricing geometric transportation networks
• Conformal mapping in linear time
• Alexandrov's theorem, weighted Delaunay triangulations, and mixed volumes
• Kinetic and dynamic Delaunay tetrahedralizations in three dimensions
• Index structures for fast similarity search for real-valued vectors. I
• A comparison of sequential Delaunay triangulation algorithms.
• GDToolkit
• Qhull
• Algorithm 785
• VRONI
• SqFreeEVAL
• Improving continuity of Voronoi-based interpolation over Delaunay spheres
• CirclePack
• FindSteinerTree
• Triangle
• FIST
• CHomP
• PolyLib
• 2D triangulations
• Hull
• QMG
• IMAGINARY
• FLANN
• QuickHull3D
• Towards exact geometric computation
• The geometry of Minkowski spaces -- a survey. II.
• largeVis
• SUGGAR++
• FSInteract
• Free-form deformation, mesh morphing and reduced-order methods: enablers for efficient aerodynamic shape optimisation
• Cocone
• CompuTop
• DGD gallery
• Detri
• GEOMETRICA
• GeoCalcLib
• Glop
• IJK
• Powercrust
• Polyominoes
• Trelis
• VaryLab
• VisPak
• SegMatch
• Axl
• Pareto navigator

This page was built for software: Voronoi