Computational geometry. Algorithms and applications.
From MaRDI portal
Publication:5452284
Cited in
(only showing first 100 items - show all)- A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes
- Placing Text Boxes on Graphs
- Fast query structures in anisotropic media
- On an extension of the Sort \& Search method with application to scheduling theory
- Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location
- Efficient folding algorithms for convex polyhedra
- 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
- Near-linear approximation algorithms for geometric hitting sets
- Place the vertices anywhere on the curve and simplify
- scientific article; zbMATH DE number 1306029 (Why is no real title available?)
- 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
- Coloring Delaunay-edges and their generalizations
- On separating points by lines
- Continuation of point clouds via persistence diagrams
- Star-quadtrees and guard-quadtrees: I/O-efficient indexes for fat triangulations and low-density planar subdivisions
- Sensitivity analysis and tailored design of minimization diagrams
- Volumetric untrimming: precise decomposition of trimmed trivariates into tensor products
- A box decomposition algorithm to compute the hypervolume indicator
- Constructive polynomial partitioning for algebraic curves in \(\mathbb{R}^3\) with applications
- Tropical bisectors and Voronoi diagrams
- Shortest rectilinear path queries to rectangles in a rectangular domain
- Marching volume polytopes algorithm
- A fictitious domain method for the simulation of thermoelastic deformations in NC-milling processes
- On 2-site Voronoi diagrams under geometric distance functions
- scientific article; zbMATH DE number 16659 (Why is no real title available?)
- k-balanced center location problem: a new multi-objective facility location problem
- An algorithm to find maximum area polygons circumscribed about a convex polygon
- Independent range sampling, revisited
- scientific article; zbMATH DE number 7559265 (Why is no real title available?)
- A survey of geodesic paths on 3D surfaces
- Grid refinement in the construction of Lyapunov functions using radial basis functions
- Designing and proving correct a convex hull algorithm with hypermaps in Coq
- A fast implementation for the 2D/3D box placement problem
- Efficient operations on discrete paths
- Discriminating Codes in Geometric Setups
- Routing among convex polygonal obstacles in the plane
- scientific article; zbMATH DE number 3919830 (Why is no real title available?)
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- 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
- Using the discrete element method to simulate brittle fracture in the indentation of a silica glass with a blunt indenter
- Algorithms for the line-constrained disk coverage and related problems
- Algorithms for the line-constrained disk coverage and related problems
- Disordered contact networks in jammed packings of frictionless disks
- Method for finding and storing optimal triangulations based on square matrix
- scientific article; zbMATH DE number 7561471 (Why is no real title available?)
- Faster algorithms for growing prioritized disks and rectangles
- A quick negative selection algorithm for one-class classification in big data era
- Minimum-width annulus with outliers: circular, square, and rectangular cases
- Dynamic convex hulls under window-sliding updates
- Voronoi game on polygons
- Maximum-width empty square and rectangular annulus
- Multi-region Delaunay complex segmentation
- A note on coloring line arrangements
- A note about weak \(\epsilon \)-nets for axis-parallel boxes in \(d\)-space
- Amortized analysis of smooth quadtrees in all dimensions
- Fault-Tolerant Compact Routing Schemes for General Graphs
- Geometric Packing under Nonuniform Constraints
- Computing Klee's measure of grounded boxes
- Adaptive succinctness
- Computational complexity aspects of point visibility graphs
- FMM-LU: A Fast Direct Solver for Multiscale Boundary Integral Equations in Three Dimensions
- Delta Voronoi smoothed particle hydrodynamics, \(\delta\)-VSPH
- Dynamic geometric data structures via shallow cuttings
- Skeleton Clustering: Dimension-Free Density-Aided Clustering
- Binary plane partitions for disjoint line segments
- Kinetic spanners in \(\mathbb R^{d}\)
- Fractal and complex network analyses of protein molecular dynamics
- A connectivity graph generation approach for Manhattan path calculation in detailed facility layout
- On some geometric problems of color-spanning sets
- Multiple filterbanks for image processing: implementation issues
- Color-spanning localized query
- Voronoi diagrams on planar graphs, and computing the diameter in deterministic \(\tilde{O}(n^{5/3})\) time
- Approximating the packedness of polygonal curves
- Dynamic connectivity in disk graphs
- Isogeometric numerical dispersion analysis for two-dimensional elastic wave propagation
- Linear programming over exponent pairs
- NURBS Enhanced Virtual Element Methods for the Spatial Discretization of the Multigroup Neutron Diffusion Equation on Curvilinear Polygonal Meshes
- Point enclosure problem for homothetic polygons
- Farthest-polygon Voronoi diagrams
- Covering polygons with rectangles
- Higher-order adaptive finite difference methods for fully nonlinear elliptic equations
- Fitting a Sobolev function to data. III
- The Euclidean bottleneck full Steiner tree problem
- Bumpy pyramid folding
- Time-space trade-offs for triangulations and Voronoi diagrams
- Shock capturing using discontinuous Galerkin method and overset grids for two-dimensional Euler equations
- Four-connected triangulations of planar point sets
- Approximation algorithms for polynomial-expansion and low-density graphs
- The complexity of dominating set in geometric intersection graphs
- Variational implementation of immersed finite element methods
- Three-dimensional crack propagation with distance-based discontinuous kernels in meshfree methods
- Time-space trade-offs for triangulations and Voronoi diagrams
- Approximation algorithms for free-label maximization
- Reasoning about visibility
- Bottleneck partial-matching Voronoi diagrams and applications
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)
