Getting around a lower bound for the minimum Hausdorff distance
type: Item
instance of: scholarly article
title: Getting around a lower bound for the minimum Hausdorff distance
zbMATH Open document ID: 0901.68201
DOI: 10.1016/S0925-7721(97)00032-1
author: L. Paul Chew
author: Klara Kedem
published in: Computational Geometry
publication date: 1998-11-26T00:00:00Z
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 1182022
zbMATH Keywords: geometric pattern matching problem
MaRDI profile type: Publication
cites work: Applications of Parametric Searching in Geometric Optimization
cites work: Geometric pattern matching in \(d\)-dimensional space
cites work: Q3138951
cites work: Finding kth paths and p-centers by generating and searching good data structures
cites work: The upper envelope of Voronoi surfaces and its applications
cites work: On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
cites work: Q3219753
cites work: New Upper Bounds in Klee’s Measure Problem
cites work: Q3992847
full work available at URL: s0925-7721(97)00032-1
OpenAlex ID: W2001909273
description: scientific article; zbMATH DE number 1182022