Share Email Print

Proceedings Paper

Fitting polygonal regions for matching 3D polyhedra
Author(s): Lopamudra Mukherjee; Vikas Singh; Jinhui Xu; Ronald Berezney
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

Matching geometric objects is a fundamental problem in computational geometry with applications in many other areas, such as computer vision, biology,and archaelogy. In this paper, we study an important partial matching problem motivated from applications in several such areas. The input is in the form of sets of under-sampled slices of one (or more) unknown 3D objects, possibly generated by slicing planes of arbitrary orientations, the question we are interested in is whether it is 'possible' that two under-sampled sets have been taken from the same object. Alternatively, can we determine with 'certainty' that the given input samples cannot be from the same object. We present efficient algorithms for addressing these questions. Our algorithm is based on interesting geometric techniques and enables answering these queries either as plausible or a certain negative.

Paper Details

Date Published: 18 January 2006
PDF: 12 pages
Proc. SPIE 6066, Vision Geometry XIV, 606607 (18 January 2006); doi: 10.1117/12.642967
Show Author Affiliations
Lopamudra Mukherjee, State Univ. of New York at Buffalo (United States)
Vikas Singh, State Univ. of New York at Buffalo (United States)
Jinhui Xu, State Univ. of New York at Buffalo (United States)
Ronald Berezney, State Univ. of New York at Buffalo (United States)

Published in SPIE Proceedings Vol. 6066:
Vision Geometry XIV
Longin Jan Latecki; David M. Mount; Angela Y. Wu, Editor(s)

© SPIE. Terms of Use
Back to Top