scientific article; zbMATH DE number 1433426

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

Publication date: 18 April 2000

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)

An FPTAS for the parametric knapsack problem ⋮ Integral points in rational polygons: a numerical semigroup approach ⋮ Top-\(k\) term-proximity in succinct space ⋮ On the arrangement of stochastic lines in \(\mathbb{R}^2\) ⋮ Approximation algorithms for aligning points ⋮ On the computational complexity of 2-interval pattern matching problems ⋮ Approximating geometric bottleneck shortest paths ⋮ Advanced programming techniques applied to CGAL's arrangement package ⋮ Rotation and lighting invariant template matching ⋮ Adaptive finite difference methods for nonlinear elliptic and parabolic partial differential equations with free boundaries ⋮ Multiple point evaluation on combined tensor product supports ⋮ Visualization of road geometries based on CADD design standards ⋮ Fuzzy distance-based range queries over uncertain moving objects ⋮ Locating leak detecting sensors in a water distribution network by solving prize-collecting Steiner arborescence problems ⋮ A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums ⋮ On incremental rendering of silhouette maps of a polyhedral scene ⋮ Minimum weight pseudo-triangulations ⋮ Transforming pseudo-triangulations ⋮ A symmetry based multiobjective clustering technique for automatic evolution of clusters ⋮ Prophet: a context-aware location privacy-preserving scheme in location sharing service ⋮ The typical cell of a Voronoi tessellation on the sphere ⋮ Nearest-neighbor searching under uncertainty. I ⋮ The pairwise flowtime network construction problem ⋮ A hybrid inference system for improved curvature estimation in the level-set method using machine learning ⋮ Faster compression of patterns to rectangle rule lists ⋮ Mind the gap! ⋮ Error-correcting neural networks for two-dimensional curvature computation in the level-set method ⋮ Accelerated Monte Carlo estimation of exceedance probabilities under monotonicity constraints ⋮ Energy minimizing mountain ascent ⋮ I/O efficient dynamic data structures for longest prefix queries ⋮ Source-location privacy full protection in wireless sensor networks ⋮ A mathematical framework for modeling axon guidance ⋮ A computational learning theory of active object recognition under uncertainty ⋮ Biased range trees ⋮ An \(O(n+m)\) certifying triconnnectivity algorithm for Hamiltonian graphs ⋮ Fast neighbor search by using revised \(k\)-d tree ⋮ Computing homotopic shortest paths efficiently ⋮ Algorithms for optimal area triangulations of a convex polygon ⋮ A mixed integer linear programming formulation of the optimal mean/Value-at-Risk portfolio problem ⋮ Dynamic 3-sided planar range queries with expected doubly-logarithmic time ⋮ GeoQuorums: implementing atomic memory in mobile ad hoc networks ⋮ Comparison of mixed and isoparametric boundary elements in time domain poroelasticity ⋮ INSIM-FT in three-dimensions with gravity ⋮ A particle-based free surface detection method and its application to the surface tension effects simulation in smoothed particle hydrodynamics (SPH) ⋮ A note on minimum-sum coverage by aligned disks ⋮ On reporting the \(L_1\) metric closest pair in a query rectangle ⋮ Largest triangle inside a terrain ⋮ Extracting constrained 2-interval subsets in 2-interval sets ⋮ The generic Gröbner walk ⋮ Higher order mobile coverage control with applications to clustering of discrete sets ⋮ A tight lower bound for computing the diameter of a 3D convex polytope ⋮ Zone theorem for arrangements in dimension three ⋮ On local transformations in plane geometric graphs embedded on small grids ⋮ Query point visibility computation in polygons with holes ⋮ Lower bounds for expected-case planar point location ⋮ Planar multi-patch domain parameterization for isogeometric analysis based on evolution of fat skeleton ⋮ An optimal algorithm for the minimum disc cover problem ⋮ Finding the optimal shape of the leading-and-trailing car of a high-speed train using design-by-morphing ⋮ A bio-inspired B-spline offset feature for structural topology optimization ⋮ Tight bound and improved algorithm for farthest-color Voronoi diagrams of line segments ⋮ Adaptive sampling for geometric problems over data streams ⋮ Data structures for halfplane proximity queries and incremental Voronoi diagrams ⋮ Improved approximation bounds for planar point pattern matching ⋮ Location of weighted anti-ordered median straight lines with Euclidean distances ⋮ Improved output-sensitive snap rounding ⋮ Probabilistic bounds on the length of a longest edge in Delaunay graphs of random points in \(d\)-dimensions ⋮ Sweep synchronization as a global propagation mechanism ⋮ Aggregation for the probabilistic traveling salesman problem ⋮ A variational meshfree method for solving time-discrete diffusion equations ⋮ How to determine the minimum number of fuzzy rules to achieve given accuracy: a computational geometric approach to SISO case ⋮ A sweep-line algorithm for the inclusion hierarchy among circles ⋮ Approximate range searching: The absolute model ⋮ Planar graphs, negative weight edges, shortest paths, and near linear time ⋮ Fast multiscale clustering and manifold identification ⋮ Regression based automatic face annotation for deformable model building ⋮ Parallelization alternatives and their performance for the convex hull problem ⋮ Kinetic collision detection for balls ⋮ A numerical study into element type and mesh resolution for crystal plasticity finite element modeling of explicit grain structures ⋮ QuickhullDisk: a faster convex hull algorithm for disks ⋮ Distributed combinatorial maps for parallel mesh processing ⋮ Total least squares fitting of \(k\)-spheres in \(n\)-D Euclidean space using an \((n+2)\)-D isometric representation ⋮ Enhancing point symmetry-based distance for data clustering ⋮ A hierarchical curve-based approach to the analysis of manifold data ⋮ Leveraging access mode declarations in a model for memory consistency in heterogeneous systems ⋮ Calculating the vertex unknowns of nine point scheme on quadrilateral meshes for diffusion equation ⋮ Equidistant representations: connecting coverage and uniformity in discrete biobjective optimization ⋮ Empirical geodesic graphs and CAT\((k)\) metrics for data analysis ⋮ A mortar method based on NURBS for curved interfaces ⋮ Dual weighted residual error estimation for the finite cell method ⋮ A non-iterative algorithm for generalized pig games ⋮ An elementary algorithm for digital arc segmentation ⋮ Computing large planar regions in terrains, with an application to fracture surfaces ⋮ The most points connected-covering problem with two disks ⋮ Crossing patterns of semi-algebraic sets ⋮ Error-correcting neural networks for semi-Lagrangian advection in the level-set method ⋮ Acrophobic guard watchtower problem ⋮ Multi-affine visible height correlation analysis for revealing rich structures of fractal time series ⋮ Synchronized sweep algorithms for scalable scheduling constraints ⋮ A numerical algorithm for multidimensional modeling of scattered data points ⋮ Isoperimetric enclosures

This page was built for publication: