Efficient algorithms for testing membership of a point in polygons and polyhedra
Journal Article
·
· Programming and Computer Software
OSTI ID:274211
- Moscow State Univ. (Russian Federation)
The article presents rather simple algorithms for testing membership of points in polygons and polyhedra, as well as for testing for intersection of a line and a polyhedron. It is shown that the proposed algorithms are more efficient than the algorithms described in the literature. 8 refs., 4 figs.
- OSTI ID:
- 274211
- Journal Information:
- Programming and Computer Software, Journal Name: Programming and Computer Software Journal Issue: 4 Vol. 17; ISSN PCSODA; ISSN 0361-7688
- Country of Publication:
- United States
- Language:
- English
Similar Records
Point-in-convex polygon and point-in-convex polyhedron algorithms with O(1) complexity using space subdivision
Deformations of polyhedra and polygons by the unitary group
Smooth appearance for polygonal surfaces
Journal Article
·
Wed Jun 08 00:00:00 EDT 2016
· AIP Conference Proceedings
·
OSTI ID:22609019
Deformations of polyhedra and polygons by the unitary group
Journal Article
·
Sat Dec 14 23:00:00 EST 2013
· Journal of Mathematical Physics
·
OSTI ID:22217742
Smooth appearance for polygonal surfaces
Conference
·
Thu Dec 31 23:00:00 EST 1987
·
OSTI ID:6987776