scientific article; zbMATH DE number 410386
From MaRDI portal
Publication:3134498
zbMATH Open0806.68109MaRDI QIDQ3134498FDOQ3134498
Authors: Ketan D. Mulmuley 
Publication date: 6 September 1993
Title of this publication is not available (Why is that?)
Recommendations
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)
Cited In (53)
- Title not available (Why is that?)
- On lazy randomized incremental construction
- Exact computation of the medial axis of a polyhedron
- Efficient algorithms for computing the $L_2$-discrepancy
- An efficient \(k\) nearest neighbors searching algorithm for a query line.
- 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
- An efficient algorithm for construction of the power diagram from the voronoi diagram in the plane
- Randomized search trees
- Nearly Optimal Planar $k$ Nearest Neighbors Queries under General Distance Functions
- Randomized incremental construction of Delaunay triangulations of nice point sets
- On constant factors in comparison-based geometric algorithms and data structures
- Title not available (Why is that?)
- REGION INTERVISIBILITY IN TERRAINS
- A simpler linear-time algorithm for intersecting two convex polyhedra in three dimensions
- 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
- AN EXPERIMENTAL STUDY OF ON-LINE METHODS FOR ZONE CONSTRUCTION IN ARRANGEMENTS OF LINES IN THE PLANE
- Far-field reflector problem and intersection of paraboloids
- 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.
- A randomized parallel algorithm for Voronoi diagrams based on symmetric convex distance functions
- RANDOMIZED EXTERNAL-MEMORY ALGORITHMS FOR LINE SEGMENT INTERSECTION AND OTHER GEOMETRIC PROBLEMS
- Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs
- On the computation of zone and double zone diagrams
- Title not available (Why is that?)
- A compact piecewise-linear Voronoi diagram for convex sites in the plane
- Faster Algorithms for Next Breakpoint and Max Value for Parametric Global Minimum Cuts
- Nearest neighbor representations of Boolean functions
- Maximum matchings in geometric intersection graphs
- Learning big (image) data via coresets for dictionaries
- 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
- Title not available (Why is that?)
- An algorithm to find the lineality space of the positive hull of a set of vectors
- Linear programming, the simplex algorithm and simple polytopes
- Geometric streaming algorithm with A sorting primitive
- Title not available (Why is that?)
- Union and split operations on dynamic trapezoidal maps
- Testing nonlinear operators
- On the complexity of randomly weighted multiplicative Voronoi diagrams
- Randomized parallel list ranking for distributed memory multiprocessors.
- Title not available (Why is that?)
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)
