FAST WIREFRAME-VISIBILITY ALGORITHM

Ezgi Gunaydin Kiper

Abstract

In this paper, a fast wireframe-visibility algorithm is introduced. The algorithm’s inputs are 3D wireframe model of an object, internal and external camera calibration parameters. Afterwards, the algorithm outputs the 2D image of the object with only visible lines and surfaces. 2D image of an object is constructed by using a camera model with the given camera calibration parameters and 3D wireframe object model. The idea behind the algorithm is finding the intersection points of all lines in 2D image of the object. These intersection points are called as critical points and the lines having them are critical lines. Lines without any critical points are regarded as normal lines. Critical and normal lines are processed separately. Critical lines are separated into smaller lines by its critical points and depth calculation is performed for the middle points of these smaller lines. For the normal lines, depth of the middle point of the normal line is calculated to determine if it is visible or not. As a result, the algorithm provides the minimum amount of point’s depth calculation. Moreover, this idea provides much faster process for the reason that there aren’t any resolution and memory problems like well-known image-space scan-line and z-buffering algorithms.

References

  1. Dong, X., 1999, D-Buffer: A new Hidden-Line Algorithm in Image Space, A master of science thesis submitted to the Department of Computer Science Memorial University of Newfoundland, Newfoundland.
  2. Hearn, D., Baker, M.P., 1997, Computer Graphics, Prentice Hall, Inc., New Jersey, 2nd edition.
  3. Zisserman, A., Hartley, R., 2003, Multiple View Geometry in computer vision, Cambridge University Press, Cambridge, 2nd edition.
Download


Paper Citation


in Harvard Style

Gunaydin Kiper E. (2008). FAST WIREFRAME-VISIBILITY ALGORITHM . In Proceedings of the Third International Conference on Computer Vision Theory and Applications - Volume 1: VISAPP, (VISIGRAPP 2008) ISBN 978-989-8111-21-0, pages 270-275. DOI: 10.5220/0001077202700275


in Bibtex Style

@conference{visapp08,
author={Ezgi Gunaydin Kiper},
title={FAST WIREFRAME-VISIBILITY ALGORITHM},
booktitle={Proceedings of the Third International Conference on Computer Vision Theory and Applications - Volume 1: VISAPP, (VISIGRAPP 2008)},
year={2008},
pages={270-275},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001077202700275},
isbn={978-989-8111-21-0},
}


in EndNote Style

TY - CONF
JO - Proceedings of the Third International Conference on Computer Vision Theory and Applications - Volume 1: VISAPP, (VISIGRAPP 2008)
TI - FAST WIREFRAME-VISIBILITY ALGORITHM
SN - 978-989-8111-21-0
AU - Gunaydin Kiper E.
PY - 2008
SP - 270
EP - 275
DO - 10.5220/0001077202700275