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