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)
- Fast query structures in anisotropic media
- On an extension of the Sort \& Search method with application to scheduling theory
- A box decomposition algorithm to compute the hypervolume indicator
- Title not available (Why is that?)
- Title not available (Why is that?)
- A survey of geodesic paths on 3D surfaces
- Designing and proving correct a convex hull algorithm with hypermaps in Coq
- Grid refinement in the construction of Lyapunov functions using radial basis functions
- Using the discrete element method to simulate brittle fracture in the indentation of a silica glass with a blunt indenter
- Efficient operations on discrete paths
- A note on coloring line arrangements
- A note about weak \(\epsilon \)-nets for axis-parallel boxes in \(d\)-space
- On some geometric problems of color-spanning sets
- Fractal and complex network analyses of protein molecular dynamics
- A connectivity graph generation approach for Manhattan path calculation in detailed facility layout
- Four-connected triangulations of planar point sets
- Farthest-polygon Voronoi diagrams
- Three-dimensional crack propagation with distance-based discontinuous kernels in meshfree methods
- Fitting a Sobolev function to data. III
- Variational implementation of immersed finite element methods
- On the least trimmed squares estimator
- Towards min max generalization in reinforcement learning
- Efficient algorithms for the one-dimensional \(k\)-center problem
- An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem
- On the geometric structures with \(n\) points and \(k\) distances
- Qualitative constraint satisfaction problems: an extended framework with landmarks
- On path-greedy geometric spanners
- Geometric algorithms and combinatorial optimization.
- Counting carambolas
- An isogeometric design-through-analysis methodology based on adaptive hierarchical refinement of NURBS, immersed boundary methods, and T-spline CAD surfaces
- Mitered offsets and skeletons for circular arc polygons
- Algorithmic aspects of proportional symbol maps
- Leader election and gathering for asynchronous fat robots without common chirality
- Least-squares polynomial approximation on weakly admissible meshes: Disk and triangle
- Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling
- Parallel finite element technique using Gaussian belief propagation
- On the representation of the search region in multi-objective optimization
- On the numerical integration of trimmed isogeometric elements
- A class of piecewise interpolating functions based on barycentric coordinates
- Opaque sets
- Linear-space data structures for range mode query in arrays
- Multi cover of a polygon minimizing the sum of areas
- From proximity to utility: a Voronoi partition of Pareto optima
- Exact algorithms and APX-hardness results for geometric packing and covering problems
- Guarding a Polygon Without Losing Touch
- 3D rectangulations and geometric matrix multiplication
- Modified refinement algorithm to construct Lyapunov functions using meshless collocation
- 3D rectangulations and geometric matrix multiplication
- Optimal randomized incremental construction for guaranteed logarithmic planar point location
- Accurate fluid-structure interaction computations using elements without mid-side nodes
- Convex polygons in geometric triangulations
- Approximating hitting sets of axis-parallel rectangles intersecting a monotone curve
- Performance of different integration schemes in facing discontinuities in the finite cell method
- Enabling high-dimensional range queries using \(k\)NN indexing techniques: approaches and empirical results
- Connecting the dots: semi-analytical and random walk numerical solutions of the diffusion-reaction equation with stochastic initial conditions
- The multi-facility median problem with Pos/Neg weights on general graphs
- Discontinuous Galerkin methods with nodal and hybrid modal/nodal triangular, quadrilateral, and polygonal elements for nonlinear shallow water flow
- Geometric approximation algorithms
- (Approximate) uncertain skylines
- On inducing polygons and related problems
- Witness (Delaunay) graphs
- On the stretch factor of Delaunay triangulations of points in convex position
- Approximating a real number by a rational number with a limited denominator: a geometric approach
- Algorithms for graphs of bounded treewidth via orthogonal range searching
- Discrete and computational geometry
- Connectivity guarantees for wireless networks with directional antennas
- Exploring or reducing noise? A global optimization algorithm in the presence of noise
- Computational geometry on surfaces. Performing computational geometry on the cylinder, the sphere, the torus, and the cone
- Convex partial transversals of planar regions
- The multicriteria \(p\)-facility median location problem on networks
- A regularization approach for estimating the type of a plane curve singularity
- Lagrangian transport through surfaces in compressible flows
- Efficient maximum matching algorithms for trapezoid graphs
- Closest pair and the post office problem for stochastic points
- Reprint of: Memory-constrained algorithms for simple polygons
- 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
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)
