The following pages link to (Q4217293):
Displaying 50 items.
- A lower bound for computing geometric spanners (Q265718) (← links)
- Faster geometric algorithms via dynamic determinant computation (Q283878) (← links)
- Delaunay triangulations of closed Euclidean \(d\)-orbifolds (Q309648) (← links)
- Designing and proving correct a convex hull algorithm with hypermaps in Coq (Q448980) (← links)
- Lifting simplicial complexes to the boundary of convex polytopes (Q449125) (← links)
- Decentralized spatial partitioning algorithms for multi-vehicle systems based on the minimum control effort metric (Q464608) (← links)
- Computing hereditary convex structures (Q540446) (← links)
- Conforming Delaunay triangulations in 3D (Q598238) (← links)
- Approximating the pathway axis and the persistence diagrams for a collection of balls in 3-space (Q603856) (← links)
- Perturbations for Delaunay and weighted Delaunay 3D triangulations (Q617544) (← links)
- The Zermelo-Voronoi diagram: a dynamic partition problem (Q624956) (← links)
- Computing the Voronoi cells of planes, spheres and cylinders in \(\mathbb{R}^3\) (Q625216) (← links)
- The overlay of minimization diagrams in a randomized incremental construction (Q633216) (← links)
- Design of computer experiments: space filling and beyond (Q693293) (← links)
- Kinetic and dynamic Delaunay tetrahedralizations in three dimensions (Q709578) (← links)
- Topology and arrangement computation of semi-algebraic planar curves (Q735517) (← links)
- Cuttings for disks and axis-aligned rectangles in three-space (Q848675) (← links)
- Meshing skin surfaces with certified topology (Q868105) (← links)
- Kant's hand, chirality and convex polytopes (Q883681) (← links)
- Computing the arrangement of circles on a sphere, with applications in structural biology (Q924070) (← links)
- The complex of non-crossing diagonals of a polygon (Q986103) (← links)
- Dynamic voltage scaling under EDF revisited (Q995822) (← links)
- Computational synthetic geometry (Q1187653) (← links)
- Tutte's barycenter method applied to isotopies (Q1395577) (← links)
- Triangulations in CGAL (Q1602941) (← links)
- Partitioning algorithms for multi-agent systems based on finite-time proximity metrics (Q1689365) (← links)
- Only distances are required to reconstruct submanifolds (Q1693317) (← links)
- On the computation of zone and double zone diagrams (Q1704894) (← links)
- An algorithm for discrete approximation by quasi-convex functions on \(R^m\) (Q1767886) (← links)
- Union and split operations on dynamic trapezoidal maps (Q1841116) (← links)
- The Safari interface for visualizing time-dependent volume data using iso-surfaces and contour spectra (Q1873157) (← links)
- Expected time analysis for Delaunay point location (Q1882851) (← links)
- Truncation error estimates of approximate operators in a generalized particle method (Q2174803) (← links)
- An \(O(n^2)\) algorithm for time-bound adjustments for the cumulative scheduling problem (Q2184136) (← links)
- Two series of polyhedral fundamental domains for Lorentz bi-quotients (Q2304639) (← links)
- Optimal partitioning for spatiotemporal coverage in a drift field (Q2356660) (← links)
- Fundamental domains in Lorentzian geometry (Q2385551) (← links)
- Updating the topology of the dynamic Voronoi diagram for spheres in Euclidean \(d\)-dimensional space (Q2388506) (← links)
- Manifold reconstruction using tangential Delaunay complexes (Q2441577) (← links)
- Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time (Q2489016) (← links)
- Euclidean push--pull partial covering problems (Q2496058) (← links)
- The problem of optimal robust Kalman state estimation via limited capacity digital communication channels (Q2504526) (← links)
- Integer knapsack problems with set-up weights (Q2642635) (← links)
- Spatial context. An introduction to fundamental computer algorithms for spatial analysis (Q2797097) (← links)
- Random Laguerre tessellations (Q3535646) (← links)
- Modeling Macromolecular Complexes: A Journey Across Scales (Q4554265) (← links)
- Faster Algorithms for Next Breakpoint and Max Value for Parametric Global Minimum Cuts (Q5041732) (← links)
- The -Delaunay tessellation: Description of the model and geometry of typical cells (Q5055367) (← links)
- Material coherence from trajectories via Burau eigenanalysis of braids (Q5112979) (← links)
- A Subdivision Method for Arrangement Computation of Semi-Algebraic Curves (Q5188772) (← links)
