Improved Approximation Bounds for Planar Point Pattern Matching

descriptionPublicationkeyboard_double_arrow_right Part of book or chapter of book , Article , Conference object 01 Jan 2005Publisher:Springer Berlin HeidelbergJournal:Algorithmica, volume 50, pages 175-207 (issn: 0178-4617, eissn: 1432-0541,

Copyright policy )Funded by:NSF | Approximation Algorithms ..., NSF | Structure-Sensitive Geome...

Authors: Minkyoung Cho; David M. Mount;

doi: 10.1007/11534273_38 , 10.1007/s00453-007-9059-9

Improved Approximation Bounds for Planar Point Pattern Matching

- Summary
- Subjects
- Metrics

Abstract

zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Related Organizations

University of Maryland
United States
University of Maryland
United States
University of Maryland, College Park
United States
EarthTech International (United States)
United States

Keywords

Hausdorff distance, Computer graphics; computational geometry (digital and algorithmic aspects), Point pattern matching, Approximation algorithms

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	9
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average