Skip to main content
Conference Proceedings

Parallel triangulation of nonconvex polytopes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1993) 657 LNCS 78-89
DOI: 10.1007/3-540-56402-0_38
0Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A new parallel algorithm for the triangulation of a nonconvex polytope P is presented. It will be shown that P can be decomposed into O(n + r2) tetrahedra within time O(log(n) · (max{log*(n), log(r)}) with O(n + r2) processors, where r denotes the number of reflex edges of P).

Cite

CITATION STYLE

APA

Preflowski, W. (1993). Parallel triangulation of nonconvex polytopes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 657 LNCS, pp. 78–89). Springer Verlag. https://doi.org/10.1007/3-540-56402-0_38

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free