scientific article; zbMATH DE number 410386
From MaRDI portal
Publication:3134498
Searching and sorting (68P10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Parallel algorithms in computer science (68W10)
Recommendations
Cited in
(53)- scientific article; zbMATH DE number 1857642 (Why is no real title available?)
- scientific article; zbMATH DE number 4032498 (Why is no real title available?)
- Exact computation of the medial axis of a polyhedron
- On lazy randomized incremental construction
- Efficient algorithms for computing the $L_2$-discrepancy
- An efficient \(k\) nearest neighbors searching algorithm for a query line.
- Faster algorithms for next breakpoint and max value for parametric global minimum cuts
- Randomized parallel list ranking for distributed memory multiprocesors
- Randomized geometric algorithms and pseudorandom generators
- Efficient decentralized algorithms for the distributed trigger counting problem
- Faster approximate diameter and distance oracles in planar graphs
- A deterministic view of random sampling and its use in geometry
- A decomposition-based approach to layered manufacturing
- Randomized search trees
- An efficient algorithm for construction of the power diagram from the voronoi diagram in the plane
- Nearly Optimal Planar $k$ Nearest Neighbors Queries under General Distance Functions
- Randomized incremental construction of Delaunay triangulations of nice point sets
- A simpler linear-time algorithm for intersecting two convex polyhedra in three dimensions
- On constant factors in comparison-based geometric algorithms and data structures
- scientific article; zbMATH DE number 431985 (Why is no real title available?)
- REGION INTERVISIBILITY IN TERRAINS
- Tight upper bounds for the discrepancy of half-spaces
- New applications of random sampling in computational geometry
- An efficient randomized algorithm for higher-order abstract Voronoi diagrams
- Far-field reflector problem and intersection of paraboloids
- AN EXPERIMENTAL STUDY OF ON-LINE METHODS FOR ZONE CONSTRUCTION IN ARRANGEMENTS OF LINES IN THE PLANE
- A new technique for analyzing substructures in arrangements of piecewise linear surfaces
- Towards dynamic randomized algorithms in computational geometry
- Average case analysis of dynamic geometric optimization
- Point location in zones of \(k\)-flats in arrangements
- Geometrie und Kombinatorik von Nash-Gleichgewichten.
- Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs
- RANDOMIZED EXTERNAL-MEMORY ALGORITHMS FOR LINE SEGMENT INTERSECTION AND OTHER GEOMETRIC PROBLEMS
- A randomized parallel algorithm for Voronoi diagrams based on symmetric convex distance functions
- On the computation of zone and double zone diagrams
- scientific article; zbMATH DE number 1419216 (Why is no real title available?)
- A compact piecewise-linear Voronoi diagram for convex sites in the plane
- Nearest neighbor representations of Boolean functions
- Learning big (image) data via coresets for dictionaries
- Maximum matchings in geometric intersection graphs
- Simultaneous scheduling and location (ScheLoc): The planar ScheLoc makespan problem
- An introduction to randomization in computational geometry
- On-line construction of the upper envelope of triangles and surface patches in three dimensions
- Dynamic Euclidean minimum spanning trees and extrema of binary functions
- An algorithm to find the lineality space of the positive hull of a set of vectors
- scientific article; zbMATH DE number 3945344 (Why is no real title available?)
- Linear programming, the simplex algorithm and simple polytopes
- Geometric streaming algorithm with A sorting primitive
- scientific article; zbMATH DE number 7525459 (Why is no real title available?)
- Union and split operations on dynamic trapezoidal maps
- Testing nonlinear operators
- Randomized parallel list ranking for distributed memory multiprocessors.
- On the complexity of randomly weighted multiplicative Voronoi diagrams
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3134498)
