scientific article; zbMATH DE number 589497

Publication date: 14 June 1994

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

motion planning computational geometry Voronoi diagrams convex hulls arrangement of lines geometric searching polygon partitioning

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (42)

Two disjoint 5-holes in point sets ⋮ Optimal regulator for the inverted pendulum via Euler-Lagrange backward integration ⋮ Quadrangulations of planar sets ⋮ Illumination of polygons with vertex lights ⋮ Computational simulation of the interactions between moving rigid bodies and incompressible two-fluid flows ⋮ Algorithmic and explicit determination of the Lovász number for certain circulant graphs ⋮ A new fast algorithm for computing the distance between two disjoint convex polygons based on Voronoi diagram ⋮ Three-dimensional unstructured mesh generation. I: Fundamental aspects of triangulation and point creation ⋮ All convex polyhedra can be clamped with parallel jaw grippers ⋮ An output sensitive algorithm for discrete convex hulls ⋮ Computing constrained minimum-width annuli of point sets ⋮ Characterizing and efficiently computing quadrangulations of planar point sets ⋮ An input-independent single pass algorithm for reconstruction from dot patterns and boundary samples ⋮ The projector algorithm: a simple parallel algorithm for computing Voronoi diagrams and Delaunay graphs ⋮ Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces ⋮ On a decomposition of regular domains into John domains with uniform constants ⋮ Non-convex analytical and geometrical tools for volume truncation, initialization and conservation enforcement in VOF methods ⋮ Optimization methods for the planning of rapid transit systems ⋮ Application of NEM in seepage analysis with a free surface ⋮ Space-time trade-offs for stack-based algorithms ⋮ Fast randomized parallel methods for planar convex hull construction ⋮ Finding the largest area axis-parallel rectangle in a polygon ⋮ Analytic Evaluation of Collocation Integrals for the Radiosity Equation ⋮ The Arlequin method as a flexible engineering design tool ⋮ From individual behaviour to an evaluation of the collective evolution of crowds along footbridges ⋮ Aggregate operators in constraint query languages ⋮ Voronoi diagrams for convex polygon-offset distance functions ⋮ Polyhedral approximation and practical convex hull algorithm for certain classes of voxel sets ⋮ A wave-propagation based volume tracking method for compressible multicomponent flow in two space dimensions ⋮ Dynamical geometry for multiscale dissipative particle dynamics ⋮ Local Delaunay-based high fidelity surface reconstruction from 3D point sets ⋮ A sampling type discernment approach towards reconstruction of a point set in \(\mathbb{R}^2\) ⋮ Evaluation of sphericity error from coordinate measurement data using computational geometric techniques ⋮ Locating stations on rapid transit lines ⋮ The natural element method in solid mechanics ⋮ An efficient algorithm for determining the extreme vertices of a moving 3D convex polyhedron with respect to a plane ⋮ Optimal output-sensitive convex hull algorithms in two and three dimensions ⋮ Output-sensitive results on convex hulls, extreme points, and related problems ⋮ Locational optimization problems solved through Voronoi diagrams ⋮ Exact computation of the sign of a finite sum ⋮ An approximate algorithm for computing multidimensional convex hulls ⋮ Experimental results on quadrangulations of sets of fixed points

This page was built for publication: