Amanote Research
Register
Sign In
An Optimal Algorithm for the On-Line Closest-Pair Problem
doi 10.1145/142675.142742
Full Text
Open PDF
Abstract
Available in
full text
Date
January 1, 1992
Authors
Christian Schwarz
Michiel Smid
Jack Snoeyink
Publisher
ACM Press
Related search
An Optimized Divide-And-Conquer Algorithm for the Closest-Pair Problem in the Planar Case
Journal of Computer Science and Technology
Hardware
Computer Science Applications
Architecture
Mathematics
Computational Theory
Theoretical Computer Science
Software
Diameter, Width, Closest Line Pair, and Parametric Searching
Discrete and Computational Geometry
Combinatorics
Mathematics
Geometry
Discrete Mathematics
Computational Theory
Topology
Theoretical Computer Science
Colored Range Closest-Pair Problem Under General Distance Functions
Parallel Genetic Algorithm and Parallel Simulated Annealing Algorithm for the Closest String Problem
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
An Optimal Algorithm for the Minimum Disc Cover Problem
Algorithmica
Applied Mathematics
Computer Science Applications
Computer Science
An Optimal Algorithm for Intersecting Line Segments in the Plane
JUMP: A Fast Deterministic Algorithm to Find the Closest Pair of Subsequences
An Electronic Algorithm to Find the Optimal Solution for the Travelling Salesman Problem
IOSR Journal of Computer Engineering
An Optimal Solution for Intuitionistic Fuzzy Assignment Problem Using Genetic Algorithm
International Journal of Mathematics Trends and Technology
