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
- 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
- Lagrangian numerical methods for ocean biogeochemical simulations
- The lion and man game on polyhedral surfaces with obstacles
- A discontinuous Galerkin scheme for Chimera overset viscous meshes on curved geometries
- Reachability problems for transmission graphs
- Reachability problems for transmission graphs
- Packing convex polygons in minimum-perimeter convex hulls
- Routing in a polygonal terrain with the shortest beacon watchtower
- Survey of quantitative methods in construction
- The range 1 query (R1Q) problem
- Computation of the metric average of 2D sets with piecewise linear boundaries
- The Euclidean \(k\)-supplier problem in \(I R^2\)
- Computing equilibria in dynamic models with occasionally binding constraints
- Title not available (Why is that?)
- On the computation of zone and double zone diagrams
- A Parallel Approach to the Variational Transfer of Discrete Fields between Arbitrarily Distributed Unstructured Finite Element Meshes
- Tracking paths
- Decompositions and boundary coverings of non-convex fat polyhedra
- Computing conforming partitions of orthogonal polygons with minimum stabbing number
- Nonuniform SINR+Voronoi diagrams are effectively uniform
- Title not available (Why is that?)
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)
