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)
- 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 no real title available?)
- 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 no real title available?)
- 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
- Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications
- Hamiltonian tetrahedralizations with Steiner points
- Constructing Voronoi diagrams from hollow spheres using conformal geometric algebra
- Characterizing regions of attraction for piecewise affine systems by continuity of discrete transition functions
- Efficient geometric-based computation of the string subsequence kernel
- Hierarchical design of fast minimum disagreement algorithms
- A new three-dimensional topology optimization method based on moving morphable components (MMCs)
- Hierarchical design of fast minimum disagreement algorithms
- Wave propagation in fractured-porous media with different percolation length of fracture systems
- Title not available (Why is no real title available?)
- Spanners for geodesic graphs and visibility graphs
- Intersection joins under updates
- 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 no real title available?)
- 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
- Selecting radiotherapy dose distributions by means of constrained optimization problems
- Local geometric spanners
- Local routing in sparse and lightweight geometric graphs
- Computing hereditary convex structures
- Ramified rectilinear polygons: coordinatization by dendrons
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)
