On Translating a Set of <I>C</I>-Oriented Faces in Three Dimensions

Xue-Hou TAN; Tomio HIRATA; Yasuyoshi INAGAKI

On Translating a Set of C-Oriented Faces in Three Dimensions

Xue-Hou TAN, Tomio HIRATA, Yasuyoshi INAGAKI

Full Text Views

0

Share
Cite this

Summary :

Recently much attention has been devoted to the problem of translating a set of geometrical objects in a given direction, one at a time, without allowing collisions between the objects. This paper studies the translation problem in three dimensions on a set of c-oriented faces", that is, the faces whose bounding edges have a constant number c of orientations. We solve the problem in O(N log² NK) time and O(N log N) space, where N is the total number of edges of the faces and K is the number of edge intersections in the projection plane. As an intermediate step, we also solve a problem related to ray-shooting. The algorithm for translating c-oriented faces finds uses in computer graphic systems.

Publication: IEICE TRANSACTIONS on Information Vol.E75-D No.3 pp.258-264

Publication Date: 1992/05/25

Publicized

Online ISSN

DOI

Type of Manuscript: PAPER

Category: Algorithm and Computational Complexity

Cite this

Copy

Xue-Hou TAN, Tomio HIRATA, Yasuyoshi INAGAKI, "On Translating a Set of C-Oriented Faces in Three Dimensions" in IEICE TRANSACTIONS on Information, vol. E75-D, no. 3, pp. 258-264, May 1992, doi: .
Abstract: Recently much attention has been devoted to the problem of translating a set of geometrical objects in a given direction, one at a time, without allowing collisions between the objects. This paper studies the translation problem in three dimensions on a set of c-oriented faces", that is, the faces whose bounding edges have a constant number c of orientations. We solve the problem in O(N log² NK) time and O(N log N) space, where N is the total number of edges of the faces and K is the number of edge intersections in the projection plane. As an intermediate step, we also solve a problem related to ray-shooting. The algorithm for translating c-oriented faces finds uses in computer graphic systems.
URL: https://globals.ieice.org/en_transactions/information/10.1587/e75-d_3_258/_p

Copy

@ARTICLE{e75-d_3_258,
author={Xue-Hou TAN, Tomio HIRATA, Yasuyoshi INAGAKI, },
journal={IEICE TRANSACTIONS on Information},
title={On Translating a Set of C-Oriented Faces in Three Dimensions},
year={1992},
volume={E75-D},
number={3},
pages={258-264},
abstract={Recently much attention has been devoted to the problem of translating a set of geometrical objects in a given direction, one at a time, without allowing collisions between the objects. This paper studies the translation problem in three dimensions on a set of c-oriented faces", that is, the faces whose bounding edges have a constant number c of orientations. We solve the problem in O(N log² NK) time and O(N log N) space, where N is the total number of edges of the faces and K is the number of edge intersections in the projection plane. As an intermediate step, we also solve a problem related to ray-shooting. The algorithm for translating c-oriented faces finds uses in computer graphic systems.},
keywords={},
doi={},
ISSN={},
month={May},}

Copy

TY - JOUR
TI - On Translating a Set of C-Oriented Faces in Three Dimensions
T2 - IEICE TRANSACTIONS on Information
SP - 258
EP - 264
AU - Xue-Hou TAN
AU - Tomio HIRATA
AU - Yasuyoshi INAGAKI
PY - 1992
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E75-D
IS - 3
JA - IEICE TRANSACTIONS on Information
Y1 - May 1992
AB - Recently much attention has been devoted to the problem of translating a set of geometrical objects in a given direction, one at a time, without allowing collisions between the objects. This paper studies the translation problem in three dimensions on a set of c-oriented faces", that is, the faces whose bounding edges have a constant number c of orientations. We solve the problem in O(N log² NK) time and O(N log N) space, where N is the total number of edges of the faces and K is the number of edge intersections in the projection plane. As an intermediate step, we also solve a problem related to ray-shooting. The algorithm for translating c-oriented faces finds uses in computer graphic systems.
ER -