Computing Visibility Subsets in an Orthogonal Polyhedron Authors: Jefri Marzal, Hong Xie, Chun Che Fung

Marzal, Jefri and Xie, Hong and Che Fung, Chun (2015) Computing Visibility Subsets in an Orthogonal Polyhedron Authors: Jefri Marzal, Hong Xie, Chun Che Fung. International Journal of Mathematical, Computational, Physical, Electrical and Computer Engineering, 9 (10).

[img]
Preview
 Text
Computing-Visibility-Subsets-in-an-Orthogonal-Polyhedron.pdf - Published Version
Download (163kB) | Preview
Official URL: http://www.waset.org

Abstract

Visibility problems are central to many computational geometry applications. One of the typical visibility problems is computing the view from a given point. In this paper, a linear time procedure is proposed to compute the visibility subsets from a corner of a rectangular prism in an orthogonal polyhedron. The proposed algorithm could be useful to solve classic 3D problems.

Type: Article
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions: Fakultas Keguruan dan Ilmu Pendidikan > Pendidikan Bahasa Inggris
Depositing User: Marzal
Date Deposited: 31 Jan 2017 09:05
Last Modified: 31 Jan 2017 09:05
URI: https://repository.unja.ac.id/id/eprint/75

Actions (login required)

View Item View Item
Repository Unja is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.