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)
- On the fast delivery problem with one or two packages
- An analysis of the sensitivity and stability of patients' preferences can lead to more appropriate medical decisions
- Constructive polynomial partitioning for algebraic curves in \(\mathbb{R}^3\) with applications
- Tropical bisectors and Voronoi diagrams
- Delta Voronoi smoothed particle hydrodynamics, \(\delta\)-VSPH
- Dynamic geometric data structures via shallow cuttings
- 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
- Faster multi-sided one-bend boundary labelling
- Window queries for intersecting objects, maximal points and approximations using coresets
- Introduction to geometric computing
- 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
- Single facility siting involving allocation decisions
- Dynamic smooth compressed quadtrees
- Title not available (Why is that?)
- Aspect ratio universal rectangular layouts
- The polygon burning problem
- 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
- Title not available (Why is that?)
- Earth pressure field modeling for tunnel face stability evaluation of EPB shield machines based on optimization solution
- An algorithmic framework for the single source shortest path problem with applications to disk graphs
- Approximation algorithms on consistent dynamic map labeling
- Spanners for directed transmission graphs
- Dynamic data structures for interval coloring
- 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
- Eliminating depth cycles among triangles in three dimensions
- On efficient computation of inter-simplex Chebyshev distance for voxelization of 2-manifold surface
- Removing depth-order cycles among triangles: an algorithm generating triangular fragments
- 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
- Star-quadtrees and guard-quadtrees: I/O-efficient indexes for fat triangulations and low-density planar subdivisions
- Independent range sampling, revisited
- A fast implementation for the 2D/3D box placement problem
- \(k\)-balanced center location problem: a new multi-objective facility location problem
- An algorithm to find maximum area polygons circumscribed about a convex polygon
- Routing among convex polygonal obstacles in the plane
- Disordered contact networks in jammed packings of frictionless disks
- Voronoi game on polygons
- Geometric Packing under Nonuniform Constraints
- Fault-Tolerant Compact Routing Schemes for General Graphs
- Covering polygons with rectangles
- Higher-order adaptive finite difference methods for fully nonlinear elliptic equations
- Bumpy pyramid folding
- Time-space trade-offs for triangulations and Voronoi diagrams
- Time-space trade-offs for triangulations and Voronoi diagrams
- Shortest paths among transient obstacles
- Sequential pursuit of multiple targets under external disturbances via Zermelo-Voronoi diagrams
- Triangulability of convex graphs and convex skewness
- Kinetic \(k\)-semi-Yao graph and its applications
- The minimum convex container of two convex polytopes under translations
- Kinetic reverse \(k\)-nearest neighbor problem
- Efficient searching in meshfree methods
- Recognizing weakly simple polygons
- Dynamic conflict-free colorings in the plane
- Geometry and generation of a new graph planarity game
- Lagrangian numerical methods for ocean biogeochemical simulations
- The lion and man game on polyhedral surfaces with obstacles
- A discontinuous Galerkin scheme for Chimera overset viscous meshes on curved geometries
- Reachability problems for transmission graphs
- Reachability problems for transmission graphs
- Packing convex polygons in minimum-perimeter convex hulls
- Routing in a polygonal terrain with the shortest beacon watchtower
- Survey of quantitative methods in construction
- The range 1 query (R1Q) problem
- Computation of the metric average of 2D sets with piecewise linear boundaries
- The Euclidean \(k\)-supplier problem in \(I R^2\)
- Computing equilibria in dynamic models with occasionally binding constraints
- Title not available (Why is that?)
- On the computation of zone and double zone diagrams
- A Parallel Approach to the Variational Transfer of Discrete Fields between Arbitrarily Distributed Unstructured Finite Element Meshes
- Tracking paths
- Decompositions and boundary coverings of non-convex fat polyhedra
- Computing conforming partitions of orthogonal polygons with minimum stabbing number
- Nonuniform SINR+Voronoi diagrams are effectively uniform
- Title not available (Why is that?)
- Faster algorithms for largest empty rectangles and boxes
- A fully general, exact algorithm for nesting irregular shapes
- Boundary labeling for rectangular diagrams
- A fast algorithm for computing irreducible triangulations of closed surfaces in \(\mathbb{E}^d\)
- STL*: extending signal temporal logic with signal-value freezing operator
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)
