State of the art in shape matching

RC Veltkamp, M Hagedoorn - Principles of visual information retrieval, 2001 - Springer
Large image databases are used in an extraordinary number of multimedia applications in
fields such as entertainment, business, art, engineering, and science. Retrieving images by …

[图书][B] Computational geometry: algorithms and applications

M De Berg - 2000 - books.google.com
This well-accepted introduction to computational geometry is a textbook for high-level
undergraduate and low-level graduate courses. The focus is on algorithms and hence the …

Perceptual issues in augmented reality revisited

E Kruijff, JE Swan, S Feiner - 2010 IEEE International …, 2010 - ieeexplore.ieee.org
This paper provides a classification of perceptual issues in augmented reality, created with a
visual processing and interpretation pipeline in mind. We organize issues into ones related …

Voronoi Diagrams.

F Aurenhammer, R Klein - Handbook of computational geometry, 2000 - books.google.com
The topic of this chapter, Voronoi diagrams, differs from other areas of computational
geometry, in that its origin dates back to the 17th century. In his book on the principles of …

Skeleton pruning by contour partitioning with discrete curve evolution

X Bai, LJ Latecki, WY Liu - IEEE transactions on pattern …, 2007 - ieeexplore.ieee.org
In this paper, we introduce a new skeleton pruning method based on contour partitioning.
Any contour partition can be used, but the partitions obtained by discrete curve evolution …

Approximation algorithms for lawn mowing and milling

EM Arkin, SP Fekete, JSB Mitchell - Computational Geometry, 2000 - Elsevier
We study the problem of finding shortest tours/paths for “lawn mowing” and “milling”
problems: Given a region in the plane, and given the shape of a “cutter”(typically, a circle or …

A spatial access-oriented implementation of a 3-D GIS topological data model for urban entities

J Lee - GeoInformatica, 2004 - Springer
D analysis in GIS is still one of the most challenging topics for research. With the goal being
to model possible movement within the built environment, this paper, therefore, proposes a …

Raising roofs, crashing cycles, and playing pool: Applications of a data structure for finding pairwise interactions

D Eppstein, J Erickson - … of the fourteenth annual symposium on …, 1998 - dl.acm.org
The straight skeleton of a polygon is a variant of the medial axis, introduced by Aichholzer et
al., defined by a shrinking process in which each edge of the polygon moves inward at a …

A voronoi diagram‐visibility graph‐potential field compound algorithm for robot path planning

E Masehian, MR Amin‐Naseri - Journal of Robotic Systems, 2004 - Wiley Online Library
Numerous methods have been developed to solve the motion planning problem, among
which the Voronoi diagram, visibility graph, and potential fields are well‐known techniques …

VRONI: An engineering approach to the reliable and efficient computation of Voronoi diagrams of points and line segments

M Held - Computational Geometry, 2001 - Elsevier
We discuss the design and implementation of a topology-oriented algorithm for the
computation of Voronoi diagrams of points and line segments in the two-dimensional …