Computational geometry. Algorithms and applications.
From MaRDI portal
Publication:5452284
zbMATH Open1140.68069MaRDI QIDQ5452284FDOQ5452284
Authors: Mark de Berg, Otfried Cheong, Marc Van Kreveld, Mark H. Overmars 
Publication date: 25 March 2008
Recommendations
Data structures (68P05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cited In (only showing first 100 items - show all)
- Between shapes, using the Hausdorff distance
- Closest-pair queries and minimum-weight queries are equivalent for squares
- Improved algorithms for the bichromatic two-center problem for pairs of points
- Discriminating Codes in Geometric Setups
- Minimum-width annulus with outliers: circular, square, and rectangular cases
- Minimum cuts in geometric intersection graphs
- On the minimum number of Steiner points of constrained 1-line-fixed Steiner tree in the Euclidean plane \(\mathbb{R}^2\)
- Maximum-width empty square and rectangular annulus
- Finding a largest-area triangle in a terrain in near-linear time
- FMM-LU: A Fast Direct Solver for Multiscale Boundary Integral Equations in Three Dimensions
- Computing Klee's measure of grounded boxes
- Linear programming over exponent pairs
- Bottleneck partial-matching Voronoi diagrams and applications
- An empirical study on randomized optimal area polygonization of planar point sets
- Guide to computational geometry processing. Foundations, algorithms, and methods.
- Algorithms for \(k\)-dispersion for points in convex position in the plane
- A new fast heuristic for labeling points
- Kinetic Voronoi diagrams and Delaunay triangulations under polygonal distance functions
- Scheduling tasks with exponential duration on unrelated parallel machines
- Towards higher-dimensional topological self-stabilization: a distributed algorithm for Delaunay graphs
- On the power of the semi-separated pair decomposition
- A general approach for cache-oblivious range reporting and approximate range counting
- Piecewise linear approximation by the method of worst segment division
- Fast algorithms for diameter-optimally augmenting paths and trees
- Resolving SINR queries in a dynamic setting
- A polytree based coupling method for non-matching meshes in 3D
- Area optimal polygonization using simulated annealing
- Efficient \(c\)-oriented range searching with DOP-trees
- Region-restricted clustering for geographic data mining
- Minimum length scale control in structural topology optimization based on the moving morphable components (MMC) approach
- Closest-pair queries in fat rectangles
- Tracking paths
- A two-phase method for solving continuous rank-one quadratic knapsack problems
- Diffusion-controlled reactions modeling in Geant4-DNA
- Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications
- MAP123: a data-driven approach to use 1D data for 3D nonlinear elastic materials modeling
- Improved bounds on absolute positiveness of multivariate polynomials
- Approximation algorithms for solving the 1-line Euclidean minimum Steiner tree problem
- Quickest visibility queries in polygonal domains
- Skew Jensen-Bregman Voronoi diagrams
- Title not available (Why is that?)
- Spatial context. An introduction to fundamental computer algorithms for spatial analysis
- Motion Planning Under Uncertainty with Complex Agents and Environments via Hybrid Search
- Vertex-colored encompassing graphs
- A fast algorithm for data collection along a fixed track
- RDELA -- a Delaunay-triangulation-based, location and covariance estimator with high breakdown point
- Algorithmic geometry. Foundations, methods, applications
- Towards an optimal method for dynamic planar point location
- A discontinuous Galerkin Chimera scheme
- Strong connectivity of sensor networks with double antennae
- Efficient independent set approximation in unit disk graphs
- Empty pseudo-triangles in point sets
- Bundling three convex polygons to minimize area or perimeter
- Approximating the bottleneck plane perfect matching of a point set
- Separating bichromatic point sets by L-shapes
- Calculation of discrepancy measures and applications
- Shortest Gently Descending Paths
- A Nitsche stabilized finite element method for embedded interfaces: application to fluid-structure interaction and rigid-body contact
- A fast and scalable bottom-left-fill algorithm to solve nesting problems using a semi-discrete representation
- Simplex Range Searching and Its Variants: A Review
- An improved FPT algorithm for the flip distance problem
- Approximating a planar convex set using a sparse grid
- Two optimization problems for unit disks
- Untangling planar curves
- Dual complexes of cubical subdivisions of \({\mathbb{R}}^{n}\)
- Path planning with divergence-based distance functions
- The Euclidean bottleneck Steiner path problem and other applications of \((\alpha ,\beta )\)-pair decomposition
- Algorithms for the line-constrained disk coverage and related problems
- Algorithms for the line-constrained disk coverage and related problems
- Amortized analysis of smooth quadtrees in all dimensions
- Computational complexity aspects of point visibility graphs
- Binary plane partitions for disjoint line segments
- Kinetic spanners in \(\mathbb R^{d}\)
- Isogeometric numerical dispersion analysis for two-dimensional elastic wave propagation
- The Euclidean bottleneck full Steiner tree problem
- Peeling potatoes near-optimally in near-linear time
- Approximation algorithms for free-label maximization
- Reasoning about visibility
- Memory-constrained algorithms for simple polygons
- Maintaining Reeb graphs of triangulated 2-manifolds
- Efficient retrieval of approximate palindromes in a run-length encoded string
- Title not available (Why is that?)
- Optimizing active ranges for consistent dynamic map labeling
- A note on searching line arrangements and applications
- Balanced partitions of 3-colored geometric sets in the plane
- Applying abstract acceleration to (co-)reachability analysis of reactive programs
- Efficient algorithms for local ranking
- Region-fault tolerant geometric spanners
- The minimum speed for a blocking problem on the half plane
- Delaunay Triangulation of Imprecise Points Simplified and Extended
- Near optimal subdivision algorithms for real root isolation
- Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points
- A general 3D contact smoothing method based on radial point interpolation
- Point visibility graph recognition is NP-hard
- Fitting a step function to a point set with outliers based on simplicial thickness data structures
- Kinetic Euclidean minimum spanning tree in the plane
- Estimation of effective diffusion coefficients of drug delivery devices in a flow-through system
- Using Voronoi diagrams to solve a hybrid facility location problem with attentive facilities
- Geometrical aggregation of finite fuzzy sets
- Improved local algorithms for spanner construction
This page was built for publication: Computational geometry. Algorithms and applications.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5452284)
