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)
- Algorithms for the line-constrained disk coverage and related problems
- Algorithms for the line-constrained disk coverage and related problems
- A note about weak \(\epsilon \)-nets for axis-parallel boxes in \(d\)-space
- 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 that?)
- 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
- Some results on point visibility graphs
- Weak visibility queries of line segments in simple polygons
- 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
- 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
- Convex hulls under uncertainty
- 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
- Uniformity of point samples in metric spaces using gap ratio
- Uniformity of point samples in metric spaces using gap ratio
- Approximating Minimization Diagrams and Generalized Proximity Search
- A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes
- Title not available (Why is that?)
- Randomized incremental construction for the Hausdorff Voronoi diagram revisited and extended
- Scandinavian thins on top of cake: new and improved algorithms for stacking and packing
- Fully-dynamic and kinetic conflict-free coloring of intervals with respect to points
- On the Power of the Semi-Separated Pair Decomposition
- Identification and quantification of multivariate interval uncertainty in finite element models
- On finding a shortest isothetic path and its monotonicity inside a digital object
- Group nearest-neighbor queries in the \(L_1\) plane
- Quell
- Minimum reload cost graph factors
- Near-linear algorithms for geometric hitting sets and set covers
- A computational and theoretical investigation of the accuracy of quasicontinuum methods
- Extending abstract acceleration methods to data-flow programs with numerical inputs
- Secure multiparty computation of solid geometric problems and their applications
- Recognition and complexity of point visibility graphs
- Bounded-degree factors of lacunary multivariate polynomials
- Counting the number of crossings in geometric graphs
- Computing the partial conjugate of convex piecewise linear-quadratic bivariate functions
- Top-\(k\) Manhattan spatial skyline queries
- Computing the coarseness with strips or boxes
- Data imprecision under \(\lambda\)-geometry model
- Near-linear approximation algorithms for geometric hitting sets
- 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
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)
