scientific article; zbMATH DE number 1033560

Otfried Schwarzkopf, Mark H. Overmars, Marc J. van Kreveld, Mark T. de Berg

Publication date: 14 July 1997

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

motion planning visibility computational geometry Delaunay triangulation 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 (only showing first 100 items - show all)

Adaptive space decomposition for fast visualization of soft objects ⋮ Constrained square-center problems ⋮ Connectivity check in 3-connected planar graphs with obstacles ⋮ GEOMETRIC STREAMING ALGORITHM WITH A SORTING PRIMITIVE ⋮ Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts ⋮ Exchangeable Bernoulli distributions: high dimensional simulation, estimation, and testing ⋮ Half-plane point retrieval queries with independent and dependent geometric uncertainties ⋮ Equal-Area Locus-Based Convex Polygon Decomposition ⋮ On density extrema for digital discs ⋮ On the construction of planar embedding for a class of orthogonal polyhedra ⋮ Spanners of Additively Weighted Point Sets ⋮ VARIATIONS OF BASE-STATION PLACEMENT PROBLEM ON THE BOUNDARY OF A CONVEX REGION ⋮ Geometric Streaming Algorithms with a Sorting Primitive ⋮ Random disambiguation paths for traversing a mapped hazard field ⋮ THE HAUSDORFF VORONOI DIAGRAM OF POLYGONAL OBJECTS: A DIVIDE AND CONQUER APPROACH ⋮ Dynamic proximity calculations for situation awareness ⋮ Hypergeometric Functions in Exact Geometric Computation ⋮ Computing Large Planar Regions in Terrains ⋮ Kolmogorov Complexity Theory over the Reals ⋮ Static competitive facility location: an overview of optimisation approaches. ⋮ On the number of regular vertices of the union of Jordan regions ⋮ On computing Hilbert bases via the Elliot--MacMahon algorithm ⋮ A fast semi-Lagrangian contouring method for moving interfaces ⋮ On the visibility graph of convex translates ⋮ On an estimate of the size of the maximum matching for a family of disjoint compact convex sets in the plane ⋮ Orienting polyhedral parts by pushing ⋮ Polygon decomposition for efficient construction of Minkowski sums ⋮ A posteriori error estimates and an adaptive scheme of least-squares meshfree method ⋮ Computational Geometry Methods and Intelligent Computing ⋮ Visibility in pattern-restricted permutations ⋮ Visibility in non-crossing and non-nesting partitions ⋮ MEASURING GEOMETRIC COMPLEXITY OF 3D MODELS FOR FEATURE RECOGNITION ⋮ An efficient cutting plane algorithm for the smallest enclosing circle problem ⋮ Tight degree bounds for pseudo-triangulations of points ⋮ Translating a regular grid over a point set ⋮ The Safari interface for visualizing time-dependent volume data using iso-surfaces and contour spectra ⋮ Higher order Delaunay triangulations ⋮ The visibility graph of congruent discs is Hamiltonian ⋮ Geometric systems of unbiased representatives ⋮ Geometric separability using orthogonal objects ⋮ Anisotropic finite elements for the Stokes problem: a posteriori error estimator and adaptive mesh ⋮ HCPO: an efficient insertion order for incremental Delaunay triangulation ⋮ An adaptable and extensible geometry kernel ⋮ Lower bounds for intersection searching and fractional cascading in higher dimension ⋮ Optimal area polygonization problems: exact solutions through geometric duality ⋮ Patient-specific vascular NURBS modeling for isogeometric analysis of blood flow ⋮ Partition of unity interpolation using stable kernel-based techniques ⋮ Kinetic sorting and kinetic convex hulls ⋮ Stable marker-particle method for the Voronoi diagram in a flow field ⋮ An approach to the distributionally robust shortest path problem ⋮ Minimum enclosing circle of a set of fixed points and a mobile point ⋮ Indexing moving points ⋮ First order Gaussian graphs for efficient structure classification ⋮ Improved algorithms for placing undesirable facilities ⋮ Algorithms for the edge-width of an embedded graph ⋮ Optimal Insertion of a Segment Highway in a City Metric ⋮ Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra ⋮ Multiple covers with balls. I: Inclusion-exclusion ⋮ The 2-center problem in three dimensions ⋮ Electoral strategies in a dynamical democratic system. Geometric models ⋮ Spanners of additively weighted point sets ⋮ Approximation of diffusion operators with discontinuous tensor coefficients on distorted meshes. ⋮ A radius of robust feasibility for uncertain farthest Voronoi cells ⋮ Algorithms for computing best coverage path in the presence of obstacles in a sensor field ⋮ On simplifying dot maps. ⋮ Speeding up the incremental construction of the union of geometric objects in practice. ⋮ Locating a semi-obnoxious covering facility with repelling polygonal regions ⋮ Voronoi diagram with visual restriction ⋮ Computing the arrangement of circles on a sphere, with applications in structural biology ⋮ Median problem in some plane triangulations and quadrangulations. ⋮ Multidimensional segment trees can do range updates in poly-logarithmic time ⋮ Ray shooting and intersection searching amidst fat convex polyhedra in 3-space ⋮ A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs ⋮ There are simple and robust refinements (almost) as good as Delaunay ⋮ A practical approach to the 2D incremental nearest-point problem suitable for different point distributions ⋮ Towards untrimmed NURBS: CAD embedded reparameterization of trimmed B-rep geometry using frame-field guided global parameterization ⋮ An architecture independent study of parallel segment trees ⋮ Near-linear time approximation schemes for geometric maximum coverage ⋮ Front tracking with moving-least-squares surfaces ⋮ Reprint of: Delaunay refinement algorithms for triangular mesh generation ⋮ Covering points with a polygon ⋮ Equal-area locus-based convex polygon decomposition ⋮ On the density and discrepancy of a 2D point set with applications to thermal analysis of VLSI chips ⋮ Euclidean farthest-point Voronoi diagram of a digital edge ⋮ Tighter lower bounds for nearest neighbor search and related problems in the cell probe model ⋮ Average adjacencies for tetrahedral skeleton-regular partitions ⋮ Efficient computation of partition of unity interpolants through a block-based searching technique ⋮ Faster algorithms for computing Hong's bound on absolute positiveness ⋮ Fast computation of smallest enclosing circle with center on a query line segment ⋮ Optimal spanners for axis-aligned rectangles ⋮ Kinetic and dynamic Delaunay tetrahedralizations in three dimensions ⋮ Optimizing a constrained convex polygonal annulus ⋮ Cost prediction for ray shooting in octrees ⋮ Local polyhedra and geometric graphs ⋮ Markov models of coarsening in two-dimensional foams with edge rupture ⋮ Recent progress in exact geometric computation ⋮ The least-squares meshfree method for the steady incompressible viscous flow ⋮ Adaptive radial basis function partition of unity interpolation: a bivariate algorithm for unstructured data ⋮ Well-testing based turbidite lobes modeling using the ensemble smoother with multiple data assimilation ⋮ Geometric filtering of pairwise atomic interactions applied to the design of efficient statistical potentials

This page was built for publication: