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
- Towards an Optimal Method for Dynamic Planar Point Location
- 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
- A polytree based coupling method for non-matching meshes in 3D
- Monotone paths in geometric triangulations
- Motion planning via manifold samples
- Calculation of Discrepancy Measures and Applications
- Minimum length scale control in structural topology optimization based on the moving morphable components (MMC) approach
- Closest-pair queries in fat rectangles
- 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
- 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
- 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
- A Nitsche stabilized finite element method for embedded interfaces: application to fluid-structure interaction and rigid-body contact
- Preprocessing imprecise points for Delaunay triangulation: simplified and extended
- 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
- Computing the Distance between Piecewise-Linear Bivariate Functions
- Untangling planar curves
- Dual complexes of cubical subdivisions of \({\mathbb{R}}^{n}\)
- Path planning with divergence-based distance functions
- Area Optimal Polygonization Using Simulated Annealing
- Title not available (Why is that?)
- The partial visibility representation extension problem
- Tracking Paths
- Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees
- The Euclidean bottleneck Steiner path problem and other applications of \((\alpha ,\beta )\)-pair decomposition
- Range closest-pair search in higher dimensions
- Coloring Delaunay-edges and their generalizations
- On separating points by lines
- Star-quadtrees and guard-quadtrees: I/O-efficient indexes for fat triangulations and low-density planar subdivisions
- Continuation of point clouds via persistence diagrams
- Volumetric untrimming: precise decomposition of trimmed trivariates into tensor products
- \(k\)-balanced center location problem: a new multi-objective facility location problem
- An algorithm to find maximum area polygons circumscribed about a convex polygon
- Title not available (Why is that?)
- Grid peeling and the affine curve-shortening flow
- A quick negative selection algorithm for one-class classification in big data era
- Multiple filterbanks for image processing: implementation issues
- Color-spanning localized query
- Approximating the packedness of polygonal curves
- Hierarchical Design of Fast Minimum Disagreement Algorithms
- The complexity of dominating set in geometric intersection graphs
- Computing optimal shortcuts for networks
- Geometric hitting set for segments of few orientations
- Almost tight bounds for eliminating depth cycles in three dimensions
- Minimum width color spanning annulus
- Planar maximum-box problem revisited
- On the restricted 1-Steiner tree problem
- Computing the Hausdorff Boundary Measure of Semialgebraic Sets
- Finding pairwise intersections inside a query range
- On the restricted \(k\)-Steiner tree problem
- Calculus of fuzzy vector-valued functions and almost periodic fuzzy vector-valued functions on time scales
- Imposing minimum length scale in moving morphable component (MMC)-based topology optimization using an effective connection status (ECS) control method
- Minimum-link shortest paths for polygons amidst rectilinear obstacles
- Location problems with continuous demand and unreliable facilities: applications of families of incremental Voronoi diagrams
- Computing the \(k\)-visibility region of a point in a polygon
- Equivalent Legendre polynomials: numerical integration of discontinuous functions in the finite element methods
- Rainbow polygons for colored point sets in the plane
- A distributed algorithm to maintain a proximity communication network among mobile agents using the Delaunay triangulation
- Index-based, high-dimensional, cosine threshold querying with optimality guarantees
- A new variational approach based on level-set function for convex hull problem with outliers
- Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs
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)
