Polyhedral Representation and Adjacency Graph in n-dimensional Digital Images

ISSN： 1077-3142

Source： Computer Vision and Image Understanding, Vol.79, Iss.3, 2000-09, pp. : 428-441

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Optimal Scheduling for UET/UET-UCT Generalized n-Dimensional Grid Task Graphs

By Andronikos T. Koziris N. Papakonstantinou G. Tsanakas P.

Journal of Parallel and Distributed Computing, Vol. 57, Iss. 2, 1999-05 ,pp. : 140-165

Academic Press

Access to resources Recommend Favorite

Curves of Genus 2 with (N, N) Decomposable Jacobians

By Shaska T.

Journal of Symbolic Computation, Vol. 31, Iss. 5, 2001-05 ,pp. : 603-617

Academic Press

Access to resources Recommend Favorite

Weak Wu Stratification in Rⁿ

By Richardson D.

Journal of Symbolic Computation, Vol. 28, Iss. 1, 1999-07 ,pp. : 213-223

Academic Press

Access to resources Recommend Favorite

Finding All Isolated Zeros of Polynomial Systems inCⁿvi a Stable Mixed Volumes

By Gao T. Li T.Y. Wang X.

Journal of Symbolic Computation, Vol. 28, Iss. 1, 1999-07 ,pp. : 187-211

Academic Press

Access to resources Recommend Favorite

On-line graph coloring of P₅-free graphs

By Cieślik Iwona

Acta Informatica, Vol. 45, Iss. 2, 2008-04 ,pp. : 79-91

Springer Publishing Company

Access to resources Recommend Favorite