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)
- Coloring Delaunay-edges and their generalizations
- On separating points by lines
- Continuation of point clouds via persistence diagrams
- Volumetric untrimming: precise decomposition of trimmed trivariates into tensor products
- Title not available (Why is that?)
- 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
- Approximation algorithms for polynomial-expansion and low-density graphs
- The complexity of dominating set in geometric intersection graphs
- Computing optimal shortcuts for networks
- Evaluation of labeling strategies for rotating maps
- The dominating set problem in geometric intersection graphs
- Minimum width color spanning annulus
- Minimum width color spanning annulus
- Planar maximum-box problem revisited
- On the restricted 1-Steiner tree problem
- Efficient Algorithms to Test Digital Convexity
- Finding pairwise intersections inside a query range
- On the restricted \(k\)-Steiner tree problem
- Approximate convex intersection detection with applications to width and Minkowski sums
- 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
- Time windowed data structures for graphs
- Title not available (Why is that?)
- 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
- Delaunay simplices in diagonally distorted lattices
- Computing maximum non-crossing matching in convex bipartite graphs
- Balanced splitting on weighted intervals
- On approximations for constructing 1-line minimum rectilinear Steiner trees in the Euclidean plane \(\mathbb{R}^2\)
- On tackling reverse convex constraints for non-overlapping of unequal circles
- A fast shortest path algorithm on terrain-like graphs
- Kolmogorov-Smirnov test for spatially correlated data
- The projections of convex lattice sets of points in \(\mathbb{E}^2\)
- Optimizing generalized kernels of polygons
- An exact geometry-based algorithm for path planning
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
- Computing the Hausdorff boundary measure of semialgebraic sets
- A computationally inexpensive algorithm for determining outer and inner enclosures of nonlinear mappings of ellipsoidal domains
- On some geometric problems of color-spanning sets
- On the computability of rotation sets and their entropies
- Computing an \(L_1\) shortest path among splinegonal obstacles in the plane
- Approximating the Packedness of Polygonal Curves
- \(1\)-line minimum rectilinear Steiner trees and related problems
- Triangulation algorithms for generating as-is floor plans
- General, robust, and efficient polyhedron intersection in the interface reconstruction library
- Generating star-shaped blocks for scaled boundary multipatch IGA
- 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
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)
