scientific article; zbMATH DE number 1220053
From MaRDI portal
Publication:4217293
Recommendations
- Algorithmic geometry. Foundations, methods, applications
- scientific article; zbMATH DE number 1006218
- scientific article; zbMATH DE number 4098746
- Algorithmic geometry. Polyhedric and algebraic methods
- scientific article; zbMATH DE number 66476
- Algorithmische Geometrie
- scientific article; zbMATH DE number 4132269
Cited in
(74)- Tutte's barycenter method applied to isotopies
- Triangulations in CGAL
- Partitioning algorithms for multi-agent systems based on finite-time proximity metrics
- Only distances are required to reconstruct submanifolds
- On the computation of zone and double zone diagrams
- An algorithm for discrete approximation by quasi-convex functions on R^m
- Union and split operations on dynamic trapezoidal maps
- The Safari interface for visualizing time-dependent volume data using iso-surfaces and contour spectra
- Expected time analysis for Delaunay point location
- Truncation error estimates of approximate operators in a generalized particle method
- An O(n^2) algorithm for time-bound adjustments for the cumulative scheduling problem
- Two series of polyhedral fundamental domains for Lorentz bi-quotients
- Optimal partitioning for spatiotemporal coverage in a drift field
- Fundamental domains in Lorentzian geometry
- Updating the topology of the dynamic Voronoi diagram for spheres in Euclidean \(d\)-dimensional space
- Manifold reconstruction using tangential Delaunay complexes
- Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time
- Euclidean push--pull partial covering problems
- The problem of optimal robust Kalman state estimation via limited capacity digital communication channels
- Integer knapsack problems with set-up weights
- A lower bound for computing geometric spanners
- Spatial context. An introduction to fundamental computer algorithms for spatial analysis
- Faster geometric algorithms via dynamic determinant computation
- Geometric approximation algorithms
- Delaunay triangulations of closed Euclidean d-orbifolds
- Random Laguerre tessellations
- scientific article; zbMATH DE number 3919830 (Why is no real title available?)
- scientific article; zbMATH DE number 2038819 (Why is no real title available?)
- Designing and proving correct a convex hull algorithm with hypermaps in Coq
- Lifting simplicial complexes to the boundary of convex polytopes
- Modeling macromolecular complexes: a journey across scales
- Decentralized spatial partitioning algorithms for multi-vehicle systems based on the minimum control effort metric
- Faster algorithms for next breakpoint and max value for parametric global minimum cuts
- The -Delaunay tessellation: Description of the model and geometry of typical cells
- Material coherence from trajectories via Burau eigenanalysis of braids
- A subdivision method for arrangement computation of semi-algebraic curves
- Adaptive Point Location in Planar Convex Subdivisions
- Guide to computational geometry processing. Foundations, algorithms, and methods.
- Computing hereditary convex structures
- Algorithmic geometry. Polyhedric and algebraic methods
- Introduction to geometric computing
- Algorithmische Geometrie
- Medical image – based computational model of pulsatile flow in saccular aneurisms
- A Penalized Synthetic Control Estimator for Disaggregated Data
- Tracing Isomanifolds in \(\mathbb{R}\) d in Time Polynomial in d using Coxeter–Freudenthal–Kuhn Triangulations
- Markov incremental constructions
- Bregman Voronoi diagrams
- Randomized incremental construction for the Hausdorff Voronoi diagram revisited and extended
- Conforming Delaunay triangulations in 3D
- Approximating the pathway axis and the persistence diagrams for a collection of balls in 3-space
- Lagrangian Voronoï meshes and particle dynamics with shocks
- Delaunay and regular triangulations as lexicographic optimal chains
- Optimal Area Polygonization by Triangulation and Visibility Search
- Perturbations for Delaunay and weighted Delaunay 3D triangulations
- The Zermelo-Voronoi diagram: a dynamic partition problem
- Computing the Voronoi cells of planes, spheres and cylinders in \(\mathbb{R}^3\)
- The overlay of minimization diagrams in a randomized incremental construction
- An interface-preserving moving mesh in multiple space dimensions
- Delaunay-like triangulation of smooth orientable submanifolds by _1-norm minimization
- Higher rank inner products, Voronoi tilings and metric degenerations of tori
- Large-scale semi-discrete optimal transport with distributed Voronoi diagrams
- Design of computer experiments: space filling and beyond
- Poisson-Laguerre tessellations
- A dynamical view of Tijdeman's solution of the chairman assignment problem
- Remarks on a new particle method
- Sparsifying disk intersection graphs for reliable connectivity
- Kinetic and dynamic Delaunay tetrahedralizations in three dimensions
- Topology and arrangement computation of semi-algebraic planar curves
- Cuttings for disks and axis-aligned rectangles in three-space
- Meshing skin surfaces with certified topology
- Kant's hand, chirality and convex polytopes
- Computing the arrangement of circles on a sphere, with applications in structural biology
- The complex of non-crossing diagonals of a polygon
- Dynamic voltage scaling under EDF revisited
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 Q4217293)
