Computational Geometric Problems in Pattern Recognition

Publisher Website

1 January 1982

book chapter
Published by Springer Nature

p. 73-91
https://doi.org/10.1007/978-94-009-7772-3_7

Abstract

No abstract available

Keywords

This publication has 23 references indexed in Scilit:

A linear algorithm for computing the visibility polygon from a point
Journal of Algorithms, 1981
Recent Results on the Average Time Behavior of Some Algorithms in Computational Geometry
Published by Springer Nature ,1981
Games, Graphs, and Galleries
Published by Springer Nature ,1981
Computing Dirichlet tessellations
The Computer Journal, 1981
An efficient algorithm for decomposing a polygon into star-shaped polygons
Pattern Recognition, 1981
Optimal Expected-Time Algorithms for Closest Point Problems
ACM Transactions on Mathematical Software, 1980
An Elementary Proof of Nonexistence of Isometries between ℓ_p^k and ℓ_q^k
IBM Journal of Research and Development, 1979
An O ( n log n ) Algorithm for Rectilinear Minimal Spanning Trees
Journal of the ACM, 1979
Decomposing a polygon into its convex parts
Published by Association for Computing Machinery (ACM) ,1979
A combinatorial theorem in plane geometry
Journal of Combinatorial Theory, Series B, 1975