Finding all anchored squares in a convex polygon in subquadratic time

Fekete, Sandor P. (1992) Finding all anchored squares in a convex polygon in subquadratic time.
Published In: Proceedings of the Fourth Canadian Conference on Computational Geometry : St. John’s, Newfoundland, August 10 - 14, 1992 Memorial Univ. of Newfoundland, Dep. of Computer Science 1992, pp. 71-76.

Abstract

We present an O(n log 2 (n)) method that finds all squares inscribed in a convex polygon with n vertices such that at least one corner lies on a vertex of the polygon. This is a revised version of the published paper.


Actions:
Download: [img] Postscript - Preprinted Version
Download (146kB) | Preview
Editorial actions: View Item View Item (Login required)
Deposit Information:
ZAIK Number: zpr95-206
Depositing User: Archive Admin
Date Deposited: 02 Apr 2001 00:00
Last Modified: 19 Dec 2011 09:46
URI: http://e-archive.informatik.uni-koeln.de/id/eprint/206