Pages that link to "Item:Q1188589"
From MaRDI portal
The following pages link to Concrete and abstract Voronoi diagrams (Q1188589):
Displaying 50 items.
- Grid refinement in the construction of Lyapunov functions using radial basis functions (Q258399) (← links)
- An almost optimal algorithm for Voronoi diagrams of non-disjoint line segments (Q283875) (← links)
- On non-smooth convex distance functions (Q287199) (← links)
- A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams (Q340524) (← links)
- Computing the map of geometric minimal cuts (Q476438) (← links)
- Bottleneck detour tree of points on a path (Q670710) (← links)
- Characterization of contour elements that generate abstract Voronoi diagrams (Q676068) (← links)
- Randomized incremental construction of abstract Voronoi diagrams (Q685599) (← links)
- A randomized incremental algorithm for the Hausdorff Voronoi diagram of non-crossing clusters (Q727968) (← links)
- Convex polygons are self-coverable (Q741609) (← links)
- A fast algorithm for data collection along a fixed track (Q744105) (← links)
- On the construction of abstract Voronoi diagrams (Q757052) (← links)
- Abstract Voronoi diagrams revisited (Q833716) (← links)
- Fuzzy skeleton by influence zones -- application to interpolation between fuzzy sets (Q835192) (← links)
- 3D meso-structural analysis of concrete specimens under uniaxial tension (Q853355) (← links)
- Fast Voronoi modeling (Q884722) (← links)
- Theory of continuous optimal set partitioning problems as a universal mathematical formalism for constructing Voronoi diagrams and their generalizations. I. Theoretical foundations (Q891710) (← links)
- Solving continuous location-districting problems with Voronoi diagrams (Q947939) (← links)
- Divide-and-conquer for Voronoi diagrams revisited (Q991182) (← links)
- Voronoi diagram for services neighboring a highway (Q1007626) (← links)
- Robustness of \(k\)-gon Voronoi diagram construction (Q1045919) (← links)
- Searching for segments with largest relative overlap (Q1186585) (← links)
- Randomized incremental construction of simple abstract Voronoi diagrams in 3-space (Q1370927) (← links)
- Casting a polyhedron with directional uncertainty (Q1405007) (← links)
- Coloring points with respect to squares (Q1688853) (← links)
- Incremental Voronoi diagrams (Q1688855) (← links)
- Forest-like abstract Voronoi diagrams in linear time (Q1699286) (← links)
- Minimizing the diameter of a spanning tree for imprecise points (Q1709600) (← links)
- Stabbing circles for sets of segments in the plane (Q1742369) (← links)
- Grid generation and optimization based on centroidal Voronoi tessellations (Q1855906) (← links)
- Strong thinning and polyhedric approximation of the surface of a voxel object (Q1861553) (← links)
- Voronoi diagrams on the sphere (Q1862122) (← links)
- On some limitations of reaction-diffusion chemical computers in relation to Voronoi diagram and its inversion (Q1865465) (← links)
- Abstract Voronoi diagram in 3-space (Q1878678) (← links)
- A compact piecewise-linear Voronoi diagram for convex sites in the plane (Q1907612) (← links)
- On Delaunay oriented matroids for convex distance functions (Q1923774) (← links)
- Coloring Delaunay-edges and their generalizations (Q1984605) (← links)
- Virtual elements and zero thickness interface-based approach for fracture analysis of heterogeneous materials (Q1986189) (← links)
- Faster approximate diameter and distance oracles in planar graphs (Q1999961) (← links)
- Maximum spanning trees in normed planes (Q2042214) (← links)
- Computing the topology of Voronoï diagrams of parallel half-lines (Q2071541) (← links)
- Application of the theory of optimal set partitioning for constructing fuzzy Voronoi diagrams (Q2086403) (← links)
- Coverage control of mobile sensor networks with directional sensing (Q2130348) (← links)
- Starshaped sets (Q2216442) (← links)
- Tight bound and improved algorithm for farthest-color Voronoi diagrams of line segments (Q2248734) (← links)
- The geodesic farthest-point Voronoi diagram in a simple polygon (Q2309478) (← links)
- Proper coloring of geometric hypergraphs (Q2324632) (← links)
- On the complexity of higher order abstract Voronoi diagrams (Q2354919) (← links)
- Optimal partitioning for spatiotemporal coverage in a drift field (Q2356660) (← links)
- ``The big sweep'': On the power of the wavefront approach to Voronoi diagrams (Q2365174) (← links)
