On the intersection of a set of direction cones

Kai Tang

doi:10.1016/0734-189X(89)90087-X

On the intersection of a set of direction cones

Kai Tang^*

^*Corresponding author for this work

Research output: Contribution to journal › Journal Article › peer-review

3 Citations (Scopus)

Abstract

A new method is suggested to compute the intersection of a set of direction cones encountered in the problem of passing a convex polyhedron through a window. The time requirement of this method is (O(nm), where n is the number of vertices of the polyhedron and m is the number of vertices of the window. Besides this time improvement, the concept of parallel congruence, which the new method is crucially based on, is discussed.

Original language	English
Pages (from-to)	357-361
Number of pages	5
Journal	Computer Vision, Graphics, & Image Processing
Volume	45
Issue number	3
DOIs	https://doi.org/10.1016/0734-189X(89)90087-X
Publication status	Published - Mar 1989
Externally published	Yes

Access to Document

10.1016/0734-189X(89)90087-X

Cite this

@article{57b6fae54c484b978fb8bfda69fc20bf,

title = "On the intersection of a set of direction cones",

abstract = "A new method is suggested to compute the intersection of a set of direction cones encountered in the problem of passing a convex polyhedron through a window. The time requirement of this method is (O(nm), where n is the number of vertices of the polyhedron and m is the number of vertices of the window. Besides this time improvement, the concept of parallel congruence, which the new method is crucially based on, is discussed.",

author = "Kai Tang",

year = "1989",

month = mar,

doi = "10.1016/0734-189X(89)90087-X",

language = "English",

volume = "45",

pages = "357--361",

journal = "Computer Vision, Graphics, \& Image Processing",

number = "3",

}

TY - JOUR

T1 - On the intersection of a set of direction cones

AU - Tang, Kai

PY - 1989/3

Y1 - 1989/3

N2 - A new method is suggested to compute the intersection of a set of direction cones encountered in the problem of passing a convex polyhedron through a window. The time requirement of this method is (O(nm), where n is the number of vertices of the polyhedron and m is the number of vertices of the window. Besides this time improvement, the concept of parallel congruence, which the new method is crucially based on, is discussed.

AB - A new method is suggested to compute the intersection of a set of direction cones encountered in the problem of passing a convex polyhedron through a window. The time requirement of this method is (O(nm), where n is the number of vertices of the polyhedron and m is the number of vertices of the window. Besides this time improvement, the concept of parallel congruence, which the new method is crucially based on, is discussed.

UR - https://www.webofscience.com/wos/woscc/full-record/WOS:A1989T494000004

UR - https://www.scopus.com/pages/publications/0024471182

U2 - 10.1016/0734-189X(89)90087-X

DO - 10.1016/0734-189X(89)90087-X

M3 - Journal Article

VL - 45

SP - 357

EP - 361

JO - Computer Vision, Graphics, & Image Processing

JF - Computer Vision, Graphics, & Image Processing

IS - 3

ER -

On the intersection of a set of direction cones

Abstract

Access to Document

Other files and links

Fingerprint

Cite this