scientific article
From MaRDI portal
zbMath0634.52001MaRDI QIDQ3772828
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
sortingcombinatorial geometryVoronoi diagramstime-complexityRadon theoremalgorithms in computational geometryarrangements of hyperplanes in Euclidean spacessearching Helly theorem
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Exact enumeration problems, generating functions (05A15) Graph theory (including graph drawing) in computer science (68R10) Other designs, configurations (05B30) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Helly-type theorems and geometric transversal theory (52A35) Research exposition (monographs, survey articles) pertaining to convex and discrete geometry (52-02)
Related Items
Sets of lines and cutting out polyhedral objects, The Safari interface for visualizing time-dependent volume data using iso-surfaces and contour spectra, On depth and deep points: A calculus., On the average complexity of 3D-Voronoi diagrams of random points on convex polytopes, An efficient \(k\) nearest neighbors searching algorithm for a query line., Separability by two lines and by nearly straight polygonal chains, Triangular range counting query in 2D and its application in finding \(k\) nearest neighbors of a line segment, Graph Laplacians, nodal domains, and hyperplane arrangements, Set membership identification of nonlinear systems, Dynamic half-space range reporting and its applications, Tight upper bounds for the discrepancy of half-spaces, Assembly sequences for polyhedra, Asymptotic speed-ups in constructive solid geometry, Staircase visibility and computation of kernels, A linear-time algorithm for constructing a circular visibility diagram, Visibility graphs of staircase polygons and the weak Bruhat order. I: From visibility graphs to maximal chains, Separation and approximation of polyhedral objects, On a class of \(O(n^ 2)\) problems in computational geometry, Almost tight upper bounds for the single cell and zone problems in the three dimensions, Efficient piecewise-linear function approximation using the uniform metric, Using topological sweep to extract the boundaries of regions in maps represented by region quadtrees, Parallel algorithms for arrangements, Sweep methods for parallel computational geometry, The overlay of lower envelopes and its applications, Incremental topological flipping works for regular triangulations, Choosing among notions of multivariate depth statistics, Lines in space: Combinatorics and algorithms, Improved heuristics for the minimum weight triangulation problem, Voronoi-like partition of lattice in cellular automata, Generalized hidden surface removal, Algorithms for generalized halfspace range searching and other intersection searching problems, Computing half-plane and strip discrepancy of planar point sets, Point location in zones of \(k\)-flats in arrangements, The exact fitting problem in higher dimensions, Finding Hamiltonian cycles in Delaunay triangulations is NP-complete, Reverse search for enumeration, Connected component and simple polygon intersection searching, Maxpolynomial equations, On stable line segments in all triangulations of a planar point set, The number of extreme triples of a planar point set, Mixed-volume computation by dynamic lifting applied to polynomial system solving, Shadow-boundaries of convex bodies, On Voronoi diagrams in the \(L_p\)-metric in \(\mathbb{R}^D\)., Optimal tetrahedralization of the 3D-region ``between a convex polyhedron and a convex polygon, Input-output decoupling for linear systems with nonlinear uncertain structure, Computational geometric approach to submodular function minimization for multiclass queueing systems, Avoiding the global sort: a faster contour tree algorithm, Global optimality in \(k\)-means clustering, Fast implementation of the Tukey depth, Penalty-based aggregation of multidimensional data, Multiple covers with balls. I: Inclusion-exclusion, Shape matching under rigid motion, On the computation of zone and double zone diagrams, Packing plane spanning trees into a point set, Computing solutions of the multiclass network equilibrium problem with affine cost functions, On absolute stability analysis by polyhedral Lyapunov functions, Three-dimensional convex hull as a fruitful source of diagrams, Metric estimates and membership complexity for Archimedean amoebae and tropical hypersurfaces, Homotheties and incidences, Cell-and-bound algorithm for chance constrained programs with discrete distributions, Collision detection algorithm of a continuous type using spherical extreme vertex diagrams, On the complexity of the \(k\)-level in arrangements of pseudoplanes, Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm, Recent progress in exact geometric computation, The multi-cover persistence of Euclidean balls, Facility location problems with uncertainty on the plane, Location problems with continuous demand and unreliable facilities: applications of families of incremental Voronoi diagrams, The limit of finite sample breakdown point of Tukey's halfspace median for general data, On the total weight of arrangements of halfplanes, Constructing arrangements optimally in parallel, Representing geometric structures in \(d\) dimensions: Topology and order, Nested cones and onion skins, Constructing the convex hull of a partially sorted set of points, On vertical ray shooting in arrangements, A new polynomially solvable class of quadratic optimization problems with box constraints, An efficient algorithm for determining the extreme vertices of a moving 3D convex polyhedron with respect to a plane, Undesirable facility location with minimal covering objectives, Combinatorial optimization and small polytopes, Optimal output-sensitive convex hull algorithms in two and three dimensions, Output-sensitive results on convex hulls, extreme points, and related problems, New lower bounds for Hopcroft's problem, A new technique for analyzing substructures in arrangements of piecewise linear surfaces, Computational aspects of relaxation complexity, Congruence, similarity, and symmetries of geometric objects, A note on the Papadimitriou-Silverberg algorithm for planning optimal piecewise-linear motion of a ladder, Applications of random sampling in computational geometry. II, Quasi-optimal range searching in spaces of finite VC-dimension, Fast and efficient parallel evaluation of the zeros of a polynomial having only real zeros, A probabilistic result on multi-dimensional Delaunay triangulations, and its application to the 2D case, Complexity of projected images of convex subdivisions, Counting problems relating to a theorem of Dirichlet, Probing the arrangement of hyperplanes, Robot motion planning and the single cell problem in arrangements, A lower bound on Voronoi diagram complexity., On the complexity of one-shot translational separability., Decision trees: Old and new results., Equivalent cyclic polygon of a euclidean travelling salesman problem tour and modified formulation, Algorithmic results for ordered median problems, Dynamic maintenance and visualization of molecular surfaces., Monotone paths in line arrangements, Exactly computing bivariate projection depth contours and median, A LIBRARY FOR DOING POLYHEDRAL OPERATIONS, Lower bounds for off-line range searching, The searching over separators strategy to solve some NP-hard problems in subexponential time, Ray shooting on triangles in 3-space, Selecting distances in the plane, Weaving patterns of lines and line segments in space, Algorithms for projecting points to give the most uniform distribution with applications to hashing, Orthogonal weightet linear \(L_ 1\) and \(L_ \infty\) approximation and applications, Voronoi diagrams over dynamic scenes, Computational complexity of inner and outer \(j\)-radii of polytopes in finite-dimensional normed spaces, Edge insertion for optimal triangulations, Topes of oriented matroids and related structures, Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem, Linearly independent split systems, Opposite-quadrant depth in the plane, Some combinatorial and algorithmic applications of the Borsuk-Ulam theorem, Improved algorithms for some competitive location centroid problems on paths, trees and graphs, Median trajectories, Compensated Convexity Methods for Approximations and Interpolations of Sampled Functions in Euclidean Spaces: Theoretical Foundations, Reputation games for undirected graphs, Unreliable point facility location problems on networks, Symbolic treatment of geometric degeneracies, Conditions for regular $B$-spline curves and surfaces, On the number of halving planes, Cyclic schedules for r irregularity occurring events, On some monotone path problems in line arrangements, Suspension bridge effect -- a consideration about numerical precision of the natural neighbor interpolation, Mechanisms for information elicitation, Computing convex hulls and counting integer points with \texttt{polymake}, A local analysis to determine all optimal solutions of \(p\)-\(k\)-\(\max\) location problems on networks, Obstacles for splitting multidimensional necklaces, Delaunay versus max-min solid angle triangulations for three-dimensional mesh generation, Valuation of Performance‐Dependent Options, New results on lower bounds for the number of (⩽ k)-facets, Multi-objective unconstrained combinatorial optimization: a polynomial bound on the number of extreme supported solutions, Nonlinear system stability boundary approximation by polytopes in state space†, Two-Dimensional Pattern Matching with Combined Scaling and Rotation, Approximate Polytope Membership Queries, Computational aspects of relaxation complexity: possibilities and limitations, Homological Shape Analysis Through Discrete Morse Theory, Reporting the crossing-free segments of a complete geometric graph, Network Essence: PageRank Completion and Centrality-Conforming Markov Chains, A mixed integer linear programming formulation of the optimal mean/Value-at-Risk portfolio problem, Counting unique-sink orientations, A simple algorithm for higher-order Delaunay mosaics and alpha shapes, Vector bundles on proper toric 3-folds and certain other schemes, a-tint: a polymake extension for algorithmic tropical intersection theory, Lower bounds for the number of small convex \(k\)-holes, The generic combinatorial algorithm for image matching with classes of projective transformations, Visibility graphs and obstacle-avoiding shortest paths, A simple method for resolving degeneracies in Delaunay triangulations, Algorithms for bivariate zonoid depth, Computing zonoid trimmed regions of bivariate data sets, RECONSTRUCTING CONVEX POLYGONS AND CONVEX POLYHEDRA FROM EDGE AND FACE COUNTS IN ORTHOGONAL PROJECTIONS, A practical approach to the 2D incremental nearest-point problem suitable for different point distributions, Combinatorial Properties of One-Dimensional Arrangements, Zone theorem for arrangements in dimension three, Triangulating a convex polygon with fewer number of non-standard bars, Computation of local radius of information in SM-IBC identification of nonlinear systems, Primal-dual simplex method for multiobjective linear programming, Pre-triangulations and liftable complexes, Modeling and Manipulating Cell Complexes in Two, Three and Higher Dimensions, Optimal grid representations, Delineating boundaries for imprecise regions, Min-Max payoffs in a two-player location game, Range search on tuples of points, Location of weighted anti-ordered median straight lines with Euclidean distances, Computing closest and farthest points for a query segment, An efficient sparse adaptation of the polytope method over \(\mathbb F_q\) and a record-high binary bivariate factorisation, The multicriteria \(p\)-facility median location problem on networks, Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron., Intersection of unit-balls and diameter of a point set in \(\mathbb R^3\)., Angle-restricted tours in the plane., Computation of a penetration measure between 3D convex polyhedral objects for collision detection, On the gap between the quadratic integer programming problem and its semidefinite relaxation, Locating an obnoxious plane, Computing the center region and its variants, Shape of an arbitrary finite point set in \(\mathbb{R}^2\), Combinatorial Bounds and Algorithmic Aspects of Image Matching under Projective Transformations, Geometric Aspects of the Space of Triangulations, Preprocessing composite cutting procedure: an approach to the integer model, Vapnik-Chervonenkis density in some theories without the independence property, I, Spanning trees with low crossing number, Optimal algorithms for computing edge weights in planar split networks, Realizing RCC8 networks using convex regions, Distributed combinatorial maps for parallel mesh processing, Modélisation géométrique de la faisabilité de plusieurs mélanges, Efficient Contact Mode Enumeration in 3D, Homology Computation During an Incremental Construction Process, New Complexity Bounds for Image Matching under Rotation and Scaling, Fast Delaunay triangulation in three dimensions, A robust algorithm for bisecting a triconnected graph with two resource sets, Book Review: Inevitable randomness in discrete mathematics, Harmonic functions for quadrilateral remeshing of arbitrary manifolds, The predicates of the Apollonius diagram: algorithmic analysis and implementation, Identification of piecewise affine systems based on statistical clustering technique, Increasing integer sequences and Goldbach's conjecture, On the zone of the boundary of a convex body, Order-\(k\) \(\alpha\)-hulls and \(\alpha\)-shapes, \(\epsilon\)-nets and simplex range queries, Minimum polygonal separation, The complexity of cutting complexes, An algorithmic approach to some problems in terrain navigation, Spectral partitioning works: planar graphs and finite element meshes, Risk bounds for statistical learning, Topologically sweeping an arrangement, On the complexity of deriving position specific score matrices from positive and negative sequences, Parametric multiple sequence alignment and phylogeny construction, Submodularity and the traveling salesman problem, Decomposing trimmed surfaces using the Voronoï diagram and a scan line algorithm, Compaction and separation algorithms for non-convex polygons and their applications, The power of pyramid decomposition in Normaliz, Exact computation of bivariate projection depth and the Stahel-Donoho estimator, Bottleneck partial-matching Voronoi diagrams and applications, Space-efficient algorithm for computing a centerpoint of a set of points in \(\mathbb{R}^2\), On the angle restricted nearest neighbor problem, Storing line segments in partition trees, Realizability of Delaunay triangulations, Partitioning arrangements of lines. I: An efficient deterministic algorithm, Construction of \(\epsilon\)-nets, Efficient binary space partitions for hidden-surface removal and solid modeling, An optimal parallel algorithm for linear programming in the plane, Algorithms for high dimensional stabbing problems, Combinatorial complexity bounds for arrangements of curves and spheres, Covering orthogonal polygons with star polygons: The perfect graph approach, The upper envelope of piecewise linear functions: Tight bounds on the number of faces, The upper envelope of piecewise linear functions: Algorithms and applications, New bounds on the unconstrained quadratic integer programming problem, Parallel computation of distance transforms, Bounding the number of \(k\)-faces in arrangements of hyperplanes, The complexity of point configurations, Cutting hyperplane arrangements, Euclidean minimum spanning trees and bichromatic closest pairs, Small-dimensional linear programming and convex hulls made easy, Points and triangles in the plane and halving planes in space, A singly exponential stratification scheme for real semi-algebraic varieties and its applications, Bisections and ham-sandwich cuts of convex polygons and polyhedra, A role of lower semicontinuous functions in the combinatorial complexity of geometric problems, On \(k\)-sets in arrangements of curves and surfaces, A basis enumeration algorithm for linear systems with geometric applications, Improved complexity bounds for location problems on the real line, Typechecking top-down XML transformations: Fixed input or output schemas, Randomized optimal algorithm for slope selection, Discrete and lexicographic Helly-type theorems, Efficient algorithms for maximum regression depth, Satisfying general proximity/similarity queries with metric trees, On disjoint concave chains in arrangements of (pseudo) lines, An upper bound on the number of planar \(K\)-sets, Almost tight bounds for \(\epsilon\)-nets, Tiling polygons with parallelograms, Arrangements of curves in the plane --- topology, combinatorics, and algorithms, Randomized incremental construction of Delaunay and Voronoi diagrams, Finding minimum area \(k\)-gons, How to find Steiner minimal trees in Euclidean \(d\)-space, Optimal parallel algorithms for point-set and polygon problems, Counting facets and incidences, A new representation and algorithm for constructing convex hulls in higher dimensional spaces, Applications of random sampling to on-line algorithms in computational geometry, Finding stabbing lines in 3-space, Counting and cutting cycles of lines and rods in space, Improved combinatorial bounds and efficient techniques for certain motion planning problems with three degrees of freedom, Farthest neighbors, maximum spanning trees and related problems in higher dimensions, Delaunay triangulations in three dimensions with finite precision arithmetic, The convergence rate of the sandwich algorithm for approximating convex functions, Reporting points in halfspaces, Intersection queries in sets of disks, Fast algorithms for greedy triangulation, Optimal time bounds for some proximity problems in the plane, Decision theoretic generalizations of the PAC model for neural net and other learning applications, Transitions in geometric minimum spanning trees, A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra, Efficient partition trees, Solving the Euclidean bottleneck biconnected edge subgraph problem by 2- relative neighborhood graphs, Upper envelope onion peeling, Minimizing the sum of diameters efficiently, The colored Tverberg's problem and complexes of injective functions, On computing the exact value of dispersion of a sequence, Optimal complexity reduction of polyhedral piecewise affine systems, Hamiltonian triangulations and circumscribing polygons of disjoint line segments, Convexity preserving interpolation and Powell-Sabin elements, Geometric medians, Quasi-optimal upper bounds for simplex range searching and new zone theorems, Parallel methods for visibility and shortest-path problems in simple polygons, Stacks, queues, and deques with order-statistic operations, Computing zonoid trimmed regions of dimension \(d>2\), The expected convex hull trimmed regions of a sample, Bisecton by global optimization revisited, The slab dividing approach to solve the Euclidean \(P\)-center problem, Bisecting a 4-connected graph with three resource sets, Depth of segments and circles through points enclosing many points: A note, A fast algorithm for the alpha-connected two-center decision problem, On regular vertices of the union of planar convex objects, A practical approximation algorithm for the LMS line estimator, Point set stratification and Delaunay depth, Dynamic ham-sandwich cuts in the plane, The analysis and the representation of balanced complex polytopes in 2D, A combinatorial geometrical approach to two-dimensional robust pattern matching with scaling and rotation, New results on lower bounds for the number of \((\leq k)\)-facets, Smallest \(k\)-point enclosing rectangle and square of arbitrary orientation, Provably good mesh generation, On range searching with semialgebraic sets, Algorithms for ham-sandwich cuts, Point location among hyperplanes and unidirectional ray-shooting, Extremal polygon containment problems, Point placement algorithms for Delaunay triangulation of polygonal domains, Efficient ray shooting and hidden surface removal, Crossing families, On stabbing lines for convex polyhedra in 3D, Optimality of the Delaunay triangulation in \(\mathbb{R}^ d\), On lines missing polyhedral sets in 3-space, \(k\)-violation linear programming, Many-face complexity in incremental convex arrangements, Computing convex hull in a floating point arithmetic, Vapnik-Chervonenkis dimension and (pseudo-)hyperplane arrangements, Counting triangle crossings and halving planes, Computing a centerpoint of a finite planar set of points in linear time, On the complexity of some basic problems in computational convexity. I. Containment problems, Better lower bounds on detecting affine and spherical degeneracies, On minimum and maximum spanning trees of linearly moving points, Derandomizing an output-sensitive convex hull algorithm in three dimensions, Localization and classification based on projections, Computing depth contours of bivariate point clouds, On nearest-neighbor graphs, Practical issues on the projection of polyhedral sets, Graph-theoretical conditions for inscribability and Delaunay realizability, How good are convex hull algorithms?, A crossing lemma for Jordan curves, Optimal and approximate bottleneck Steiner trees, On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees, The common exterior of convex polygons in the plane, Optimal, output-sensitive algorithms for constructing planar hulls in parallel, Exact computation of the halfspace depth, On the number of simplicial complexes in \(\mathbb{R}^ d\), Three-dimensional unstructured mesh generation. I: Fundamental aspects of triangulation and point creation, Localization of VC classes: beyond local Rademacher complexities, Improved upper bounds for approximation by zonotopes, Erased arrangements of linear and convex decompositions of polyhedra, On fat partitioning, fat covering and the union size of polygons, Combinatorial aspects of geometric graphs, Compactifications of the configuration space of six points of the projective plane and fundamental solutions of the hypergeometric system of type \((3,6)\), A lower bound for randomized algebraic decision trees, Randomization and the computational power of analytic and algebraic decision trees, Dynamics and limiting behavior of Julia sets of König's method for multiple roots, Illumination by floodlights, PAC-learning from general examples, Algorithms for bivariate medians and a Fermat-Torricelli problem for lines., Tutte's barycenter method applied to isotopies, Decomposable multi-parameter matroid optimization problems., Norm-based approximation in multicriteria programming., The complexity of hyperplane depth in the plane, Sorting weighted distances with applications to objective function evaluations in single facility location problems., The upper envelope of Voronoi surfaces and its applications, Interval probability propagation, Degree constrained tree embedding into points in the plane, Cutting hyperplanes for divide-and-conquer, On the zone of a surface in a hyperplane arrangement, On the randomized construction of the Delaunay tree, An efficient algorithm for finding the CSG representation of a simple polygon, On arrangements of Jordan arcs with three intersections per pair, Implicitly representing arrangements of lines or segments, A computational basis for higher-dimensional computational geometry and applications, On some geometric selection and optimization problems via sorted matrices, Isolating points by lines in the plane, Finding minimum area simple pentagons, The catline for deep regression, A nearly parallel algorithm for the Voronoi diagram of a convex polygon, Detecting geometric infeasibility, The widest k-dense corridor problems, Guarding galleries where no point sees a small area., Noise-tolerant parallel learning of geometric concepts, Stabbing information of a simple polygon, Solving restricted line location problems via a dual interpretation, Halfspace depth and regression depth characterize the empirical distribution, An approximate algorithm for computing multidimensional convex hulls, Bipartite embeddings of trees in the plane, Placing two disks in a convex polygon, A software package of algorithms and heuristics for disjoint paths in \textit{Pla}nar \textit{Net}works, Efficient searching with linear constraints, A comment on a minmax location problem, Numerical stability of a convex hull algorithm for simple polygons, An optimal convex hull algorithm in any fixed dimension, An invariant property of balls in arrangements of hyperplanes, A bound on local minima of arrangements that implies the upper bound theorem, Arrangements of oriented hyperplanes, \(l_\infty\)-approximation via subdominants., A parallel algorithm for constructing projection polyhedra, The rooted tree embedding problem into points in the plane, On the union of fat wedges and separating a collection of segments by a line, Representing polyhedra: Faces are better than vertices, Convex polyhedra in \(\mathbb{R}^3\) spanning \(\Omega(n^{4/3})\) congruent triangles, Algorithms for ordering unorganized points along parametrized curves, Improving continuity of Voronoi-based interpolation over Delaunay spheres, Geometry of the space of phylogenetic trees, Enumerating extreme points of a highly degenerate polytope, A sweepline algorithm to solve the two-center problem, Regular triangulations of dynamic sets of points, Estimating the number of vertices of a polyhedron, On the sum of squares of cell complexities in hyperplane arrangements, A workbench for computational geometry, Lower bounds on the length of monotone paths in arrangements, The Szemerédi-Trotter theorem in the complex plane, Two disjoint 5-holes in point sets, Faster geometric algorithms via dynamic determinant computation, Distance-sensitive planar point location, Computation of projection regression depth and its induced median, Approximate center points in dense point sets, Towards optimal two-dimensional indexing for constraint databases, A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes, Exact algorithms for size constrained 2-clustering in the plane, A strong lower bound for approximate nearest neighbor searching, Kinetic collision detection with fast flight plan changes, Efficient algorithms for counting and reporting pairwise intersections between convex polygons, Do voters vote ideologically?, The learnability of voting rules, The embracing Voronoi diagram and closest embracing number, Chromatic distribution of \(k\)-nearest neighbors of a line segment in a planar colored point set, A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams, A new representation of orientable 2-manifold polygonal surfaces for geometric modelling, New semidefinite programming relaxations for box constrained quadratic program, Proximate point searching, A model-free no-arbitrage price bound for variance options, Generalized ham-sandwich cuts, Long non-crossing configurations in the plane, Normaliz: Algorithms for affine monoids and rational cones, The multi-facility median problem with Pos/Neg weights on general graphs, \(k\)-capture in multiagent pursuit evasion, or the lion and the hyenas, On the union complexity of diametral disks, A note on visibility-constrained Voronoi diagrams, Convex hull algorithms for piecewise linear-quadratic functions in computational convex analysis, On a class of \(O(n^2)\) problems in computational geometry, Competing output-sensitive frame algorithms, On zero duality gap in nonconvex quadratic programming problems, Range minima queries with respect to a random permutation, and approximate range counting, The ordinary line problem revisited, Minimizing the error of linear separators on linearly inseparable data, On levels in arrangements of surfaces in three dimensions, A stronger conclusion to the classical ham sandwich theorem, Unified set membership theory for identification, prediction and filtering of nonlinear systems, A polynomial-time recursive algorithm for some unconstrained quadratic optimization problems, Reachability determination in acyclic Petri nets by cell enumeration approach, Designing and proving correct a convex hull algorithm with hypermaps in Coq, A bichromatic incidence bound and an application, On the least trimmed squares estimator, Geodesic order types, The power and limitations of uniform samples in testing properties of figures, On the number of separable partitions, Lower bounds for the number of hyperplanes separating two finite sets of points, Bounds on the cost of compatible refinement of simplex decomposition trees in arbitrary dimensions, The legacy of automatic mesh generation from solid modeling, An incremental algorithm for Betti numbers of simplicial complexes on the 3-sphere, Why is the 3D Delaunay triangulation difficult to construct?, Implementation of a randomized algorithm for Delaunay and regular triangulations in three dimensions, A pseudo-algorithmic separation of lines from pseudo-lines, \(\varepsilon\)-approximations of \(k\)-label spaces, Fast randomized parallel methods for planar convex hull construction, On intersecting a point set with Euclidean balls, On counting pairs of intersecting segments and off-line triangle range searching, Towards exact geometric computation, Geometric pattern matching under Euclidean motion, Continuous location under the effect of `refraction', Multiple covers with balls. II: Weighted averages, Range searching with efficient hierarchical cuttings, An upper bound for conforming Delaunay triangulations, On ray shooting in convex polytopes, A theorem on the average number of subfaces in arrangements and oriented matroids, The power of parallel projection, Four results on randomized incremental constructions, Algorithms for weak and wide separation of sets, Antipodal graphs and oriented matroids, Linear time algorithms for some separable quadratic programming problems, Geometric Knapsack problems, Optimal slope selection via expanders, On the barrier graph of an arrangement of ray sensors, Constructing a Pareto front approximation for decision making, New complexity bounds for image matching under rotation and scaling, Parametric analysis of alignment and phylogenetic uncertainty, On the structure of the solution set for the single facility location problem with average distances, Stabbers of line segments in the plane, A geometric method of sector decomposition, The combinatorial structure of random polytopes, Delaunay partitions in \(\mathbb R^n\) applied to non-convex programs and vertex/facet enumeration problems, Efficient on-line algorithms for Euler diagram region computation, The complexity and construction of many faces in arrangements of lines and of segments, The complexity of many cells in arrangements of planes and related problems, On the maximum size of an anti-chain of linearly separable sets and convex pseudo-discs, Constructions and complexity of secondary polytopes, A deterministic view of random sampling and its use in geometry, Construction of Voronoi diagrams in the plane by using maps, Computing a sweeping-plane in regular (``general) position: A numerical and a symbolic solution, An acyclicity theorem for cell complexes in d dimensions, Variations on the theme of repeated distances, On constructing the relative neighborhood graphs in Euclidean k- dimensional spaces, A dual approach to detect polyhedral intersections in arbitrary dimensions, Order-k Voronoi diagrams of sites with additive weights in the plane, Toughness and Delaunay triangulations, Dynamic partition trees, Using Gale transforms in computational geometry, Construction of three-dimensional Delaunay triangulations using local transformations, Computing halfspace depth contours based on the idea of a circular sequence, An augmented spatial digital tree algorithm for contact detection in computational mechanics, The minimum expectation selection problem, Complexity and Polynomially Solvable Special Cases of QUBO, On $\ell_p$-Support Vector Machines and Multidimensional Kernels, On intersection searching problems involving curved objects, An O(log log n) algorithm to compute the kernel of a polygon, Neighbours on a grid, Output-sensitive cell enumeration in hyperplane arrangements, Approximating finite weighted point sets by hyperplanes, Two- and three- dimensional point location in rectangular subdivisions, Convex polygons made from few lines and convex decompositions of polyhedra, Voronoi diagrams of moving points in higher dimensional spaces, Selection in monotone matrices and computing k th nearest neighbors, A nearly optimal parallel algorithm for the Voronoi diagram of a convex polygon, The two-line center problem from a polar view: a new algorithm and data structure, On the complexity of approximating and illuminating three-dimensional convex polyhedra, Arrangements in higher dimensions: Voronoi diagrams, motion planning, and other applications, Diameter and Curvature: Intriguing Analogies, Probing a set of hyperplanes by lines and related problems, Filling polyhedral molds, Unnamed Item, BIFURCATIONS OF VORONOI DIAGRAMS AND ITS APPLICATION TO BRAID THEORY, A survey of mass partitions, Packing 1-plane Hamiltonian cycles in complete geometric graphs, A new approach for the computation of halfspace depth in high dimensions, On nearest-neighbor graphs, Constrained independence system and triangulations of planar point sets, Towards Lower Bounds on the Depth of ReLU Neural Networks, Geometric pattern matching in d-dimensional space, The centroid of points with approximate weights, Linear time algorithms for testing approximate congruence in the plane, Epsilon-nets for halfplanes, Combinatorial and geometric approaches to counting problems on linear matroids, graphic arrangements, and partial orders, The projector algorithm: a simple parallel algorithm for computing Voronoi diagrams and Delaunay graphs, Computing the multicover bifiltration, Convergent Hahn series and tropical geometry of higher rank, Fast separator decomposition for finite element meshes, Unnamed Item, Unnamed Item, Unnamed Item, On the Richter–Thomassen Conjecture about Pairwise Intersecting Closed Curves, Linear approximation of simple objects, Approximating Tverberg points in linear time for any fixed dimension, Testing convexity of figures under the uniform distribution, Robot motion planning, Curvature approximation of 3D manifolds in 4D space, A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes, A commutative algebraic approach to the fitting problem, Curvature approximation of 3D manifolds in 4D space, Paul Erdős, 1913-1996, On the number of regular vertices of the union of Jordan regions, Two-variable linear programming in parallel, Manifold reconstruction in arbitrary dimensions using witness complexes, On approximate range counting and depth, A Practical, Globally Optimal Algorithm for Geometric Matching under Uncertainty, Sweeps, arrangements and signotopes, A simple proof of an estimate for the approximation of the Euclidean ball and the Delone triangulation numbers, On the number of regular vertices of the union of Jordan regions, Dynamic partition trees, Dynamically maintaining the widest \(k\)-dense corridor, Voronoi diagrams on piecewise flat surfaces and an application to biological growth, Matching colored points in the plane: Some new results, Fast algorithms for greedy triangulation, Applications of a semi-dynamic convex hull algorithm, Intersection queries in sets of disks, Upper envelope onion peeling, Unnamed Item, Sequential incorporation of imprecise information in multiple criteria decision processes, On \(\beta\)-skeleton as a subgraph of the minimum weight triangulation, Two-variable linear programming in parallel, A tail estimate for Mulmuley's segment intersection algorithm, Modélisation et optimisation numérique pour la reconstruction d'un polyèdre à partir de son image gaussienne généralisée, Four results on randomized incremental constructions, Conformal Flattening on the Probability Simplex and Its Applications to Voronoi Partitions and Centroids, Compensated Convexity Methods for Approximations and Interpolations of Sampled Functions in Euclidean Spaces: Applications to Contour Lines, Sparse Data, and Inpainting, On range searching with semialgebraic sets, Unnamed Item, Subquadratic Encodings for Point Configurations, The Multi-cover Persistence of Euclidean Balls, Algorithms for generalized halfspace range searching and other intersection searching problems, Unnamed Item
