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
- 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 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
- 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
- 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
- Preprocessing imprecise points for Delaunay triangulation: simplified and extended
- 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
- 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
- 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
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)
