Diameter, Width, Closest Line Pair, and Parametric Searching

Discrete and Computational Geometry - United States
doi 10.1007/bf02573973
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

An Optimal Algorithm for the On-Line Closest-Pair Problem

1992English

Colored Range Closest-Pair Problem Under General Distance Functions

2019English

JUMP: A Fast Deterministic Algorithm to Find the Closest Pair of Subsequences

2018English

Dark Line Detection With Line Width Extraction

2008English

Parametric Problems on Graphs of Bounded Tree-Width

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1992English

An Optimized Divide-And-Conquer Algorithm for the Closest-Pair Problem in the Planar Case

Journal of Computer Science and Technology
HardwareComputer Science ApplicationsArchitectureMathematicsComputational TheoryTheoretical Computer ScienceSoftware
2012English

Terminal Costs for On-Line Searching

College and Research Libraries
LibraryInformation Sciences
1977English

Parametric Meta-Filter Modeling From a Single Example Pair

Visual Computer
Pattern RecognitionComputer VisionComputer GraphicsComputer-Aided DesignSoftware
2014English

Eigen Modes and Ferromagnetic Resonance Line Width of Inhomogeneous Thin Films

English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy