scientific article; zbMATH DE number 1220053

Mariette Yvinec, Jean-Daniel Boissonnat

Publication date: 8 November 1998

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

computational geometry algorithmic geometry

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Geometry (51-XX)

Related Items (58)

A lower bound for computing geometric spanners ⋮ The Safari interface for visualizing time-dependent volume data using iso-surfaces and contour spectra ⋮ A Penalized Synthetic Control Estimator for Disaggregated Data ⋮ Faster geometric algorithms via dynamic determinant computation ⋮ Faster Algorithms for Next Breakpoint and Max Value for Parametric Global Minimum Cuts ⋮ Tracing Isomanifolds in \(\mathbb{R}\) ^d in Time Polynomial in d using Coxeter–Freudenthal–Kuhn Triangulations ⋮ Expected time analysis for Delaunay point location ⋮ The -Delaunay tessellation: Description of the model and geometry of typical cells ⋮ Delaunay triangulations of closed Euclidean \(d\)-orbifolds ⋮ Cuttings for disks and axis-aligned rectangles in three-space ⋮ Fundamental domains in Lorentzian geometry ⋮ Adaptive Point Location in Planar Convex Subdivisions ⋮ Modeling Macromolecular Complexes: A Journey Across Scales ⋮ Integer knapsack problems with set-up weights ⋮ Updating the topology of the dynamic Voronoi diagram for spheres in Euclidean \(d\)-dimensional space ⋮ Meshing skin surfaces with certified topology ⋮ Conforming Delaunay triangulations in 3D ⋮ Truncation error estimates of approximate operators in a generalized particle method ⋮ Approximating the pathway axis and the persistence diagrams for a collection of balls in 3-space ⋮ Kant's hand, chirality and convex polytopes ⋮ An \(O(n^2)\) algorithm for time-bound adjustments for the cumulative scheduling problem ⋮ Perturbations for Delaunay and weighted Delaunay 3D triangulations ⋮ Tutte's barycenter method applied to isotopies ⋮ Partitioning algorithms for multi-agent systems based on finite-time proximity metrics ⋮ Lagrangian Voronoï meshes and particle dynamics with shocks ⋮ The Zermelo-Voronoi diagram: a dynamic partition problem ⋮ Computing the Voronoi cells of planes, spheres and cylinders in \(\mathbb{R}^3\) ⋮ Only distances are required to reconstruct submanifolds ⋮ Delaunay and regular triangulations as lexicographic optimal chains ⋮ Optimal Area Polygonization by Triangulation and Visibility Search ⋮ Material coherence from trajectories via Burau eigenanalysis of braids ⋮ The overlay of minimization diagrams in a randomized incremental construction ⋮ On the computation of zone and double zone diagrams ⋮ Designing and proving correct a convex hull algorithm with hypermaps in Coq ⋮ Lifting simplicial complexes to the boundary of convex polytopes ⋮ Manifold reconstruction using tangential Delaunay complexes ⋮ Random Laguerre tessellations ⋮ Computing the arrangement of circles on a sphere, with applications in structural biology ⋮ Decentralized spatial partitioning algorithms for multi-vehicle systems based on the minimum control effort metric ⋮ Markov incremental constructions ⋮ Design of computer experiments: space filling and beyond ⋮ Computing hereditary convex structures ⋮ Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time ⋮ An algorithm for discrete approximation by quasi-convex functions on \(R^m\) ⋮ Kinetic and dynamic Delaunay tetrahedralizations in three dimensions ⋮ Euclidean push--pull partial covering problems ⋮ A Subdivision Method for Arrangement Computation of Semi-Algebraic Curves ⋮ The complex of non-crossing diagonals of a polygon ⋮ The problem of optimal robust Kalman state estimation via limited capacity digital communication channels ⋮ Dynamic voltage scaling under EDF revisited ⋮ Bregman Voronoi diagrams ⋮ Topology and arrangement computation of semi-algebraic planar curves ⋮ Medical image – based computational model of pulsatile flow in saccular aneurisms ⋮ Two series of polyhedral fundamental domains for Lorentz bi-quotients ⋮ Union and split operations on dynamic trapezoidal maps ⋮ Triangulations in CGAL ⋮ Randomized incremental construction for the Hausdorff Voronoi diagram revisited and extended ⋮ Optimal partitioning for spatiotemporal coverage in a drift field

This page was built for publication: