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)
- Constructive polynomial partitioning for algebraic curves in \(\mathbb{R}^3\) with applications
- Tropical bisectors and Voronoi diagrams
- Batched point location in SINR diagrams via algebraic tools
- On the shortest separating cycle
- The maximum-level vertex in an arrangement of lines
- Adaptive succinctness
- Computing Shapley values in the plane
- Discovering distorted repeating patterns in polyphonic music through longest increasing subsequences
- Convexity-increasing morphs of planar graphs
- Title not available (Why is that?)
- Approximate polytope membership queries
- Introduction to geometric computing
- Efficient Algorithms to Test Digital Convexity
- Sequence to graph alignment using gap-sensitive co-linear chaining
- Efficiently testing digital convexity and recognizing digital convex polygons
- Stronger Tradeoffs for Orthogonal Range Querying in the Semigroup Model
- On dominating set of some subclasses of string graphs
- Rearranging a sequence of points onto a line
- Title not available (Why is that?)
- Single facility siting involving allocation decisions
- Dynamic smooth compressed quadtrees
- Aspect ratio universal rectangular layouts
- The polygon burning problem
- On approximations for constructing 1-line minimum rectilinear Steiner trees in the Euclidean plane \(\mathbb{R}^2\)
- On tackling reverse convex constraints for non-overlapping of unequal circles
- A fast shortest path algorithm on terrain-like graphs
- Optimizing generalized kernels of polygons
- Co-linear chaining with overlaps and gap costs
- Bipartite diameter and other measures under translation
- K-dominance in multidimensional data: theory and applications
- Finding pairwise intersections of rectangles in a query rectangle
- A computationally inexpensive algorithm for determining outer and inner enclosures of nonlinear mappings of ellipsoidal domains
- Title not available (Why is that?)
- Earth pressure field modeling for tunnel face stability evaluation of EPB shield machines based on optimization solution
- On the computability of rotation sets and their entropies
- Approximation algorithms on consistent dynamic map labeling
- Computing an \(L_1\) shortest path among splinegonal obstacles in the plane
- Dynamic data structures for interval coloring
- \(1\)-line minimum rectilinear Steiner trees and related problems
- Triangulation algorithms for generating as-is floor plans
- Preprocessing Ambiguous Imprecise Points
- Reachable region query and its applications
- Variations of largest rectangle recognition amidst a bichromatic point set
- Approximate range closest-pair queries
- Gathering by repulsion
- Maximizing ink in partial edge drawings of \(k\)-plane graphs
- On efficient computation of inter-simplex Chebyshev distance for voxelization of 2-manifold surface
- Emerging spanning trees in the work of Candilis-Josic-Woods
- Subquadratic algorithms for some \textsc{3sum}-hard geometric problems in the algebraic decision-tree model
- Efficient folding algorithms for convex polyhedra
- Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location
- 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\)
- 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
- Amortized analysis of smooth quadtrees in all dimensions
- Linear programming over exponent pairs
- Bottleneck partial-matching Voronoi diagrams and applications
- Guide to computational geometry processing. Foundations, algorithms, and methods.
- Algorithms for \(k\)-dispersion for points in convex position in the plane
- 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
- Routing in unit disk graphs
- Fast algorithms for diameter-optimally augmenting paths and trees
- Delaunay Triangulation of Imprecise Points Simplified and Extended
- Resolving SINR queries in a dynamic setting
- A polytree based coupling method for non-matching meshes in 3D
- Monotone paths in geometric triangulations
- Area optimal polygonization using simulated annealing
- Motion planning via manifold samples
- 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
- 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?)
- 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
- Range queries on uncertain data
- Efficient independent set approximation in unit disk graphs
- Empty pseudo-triangles in point sets
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)
