scientific article

Publication date: 6 September 1993

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

computational geometry randomized methods

Searching and sorting (68P10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35)

Related Items (43)

An efficient $k$ nearest neighbors searching algorithm for a query line. ⋮ Faster Algorithms for Next Breakpoint and Max Value for Parametric Global Minimum Cuts ⋮ Dynamic Euclidean minimum spanning trees and extrema of binary functions ⋮ Tight upper bounds for the discrepancy of half-spaces ⋮ Far-field reflector problem and intersection of paraboloids ⋮ Testing nonlinear operators ⋮ An introduction to randomization in computational geometry ⋮ GEOMETRIC STREAMING ALGORITHM WITH A SORTING PRIMITIVE ⋮ Exact computation of the medial axis of a polyhedron ⋮ A compact piecewise-linear Voronoi diagram for convex sites in the plane ⋮ Linear programming, the simplex algorithm and simple polytopes ⋮ On-line construction of the upper envelope of triangles and surface patches in three dimensions ⋮ Average case analysis of dynamic geometric optimization ⋮ Point location in zones of $k$-flats in arrangements ⋮ Randomized geometric algorithms and pseudorandom generators ⋮ Randomized search trees ⋮ Nearest neighbor representations of Boolean functions ⋮ An efficient randomized algorithm for higher-order abstract Voronoi diagrams ⋮ Maximum matchings in geometric intersection graphs ⋮ Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs ⋮ On the computation of zone and double zone diagrams ⋮ An efficient algorithm for construction of the power diagram from the voronoi diagram in the plane ⋮ REGION INTERVISIBILITY IN TERRAINS ⋮ An algorithm to find the lineality space of the positive hull of a set of vectors ⋮ Randomized parallel list ranking for distributed memory multiprocessors. ⋮ Faster approximate diameter and distance oracles in planar graphs ⋮ Efficient decentralized algorithms for the distributed trigger counting problem ⋮ A randomized parallel algorithm for Voronoi diagrams based on symmetric convex distance functions ⋮ AN EXPERIMENTAL STUDY OF ON-LINE METHODS FOR ZONE CONSTRUCTION IN ARRANGEMENTS OF LINES IN THE PLANE ⋮ Unnamed Item ⋮ Geometrie und Kombinatorik von Nash-Gleichgewichten. ⋮ Simultaneous scheduling and location (ScheLoc): The planar ScheLoc makespan problem ⋮ A simpler linear-time algorithm for intersecting two convex polyhedra in three dimensions ⋮ On lazy randomized incremental construction ⋮ Learning big (image) data via coresets for dictionaries ⋮ Randomized incremental construction of Delaunay triangulations of nice point sets ⋮ A new technique for analyzing substructures in arrangements of piecewise linear surfaces ⋮ Efficient algorithms for computing the $L_2$-discrepancy ⋮ Union and split operations on dynamic trapezoidal maps ⋮ Nearly Optimal Planar $k$ Nearest Neighbors Queries under General Distance Functions ⋮ A decomposition-based approach to layered manufacturing ⋮ On constant factors in comparison-based geometric algorithms and data structures ⋮ On the complexity of randomly weighted multiplicative Voronoi diagrams

This page was built for publication: