A greedy Delaunay-based surface reconstruction algorithm

ISSN： 0178-2789

Source： The Visual Computer, Vol.20, Iss.1, 2004-04, pp. : 4-16

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

Two-dimensional Delaunay-based anisotropic mesh adaptation

By Pagnutti Doug Ollivier-Gooch Carl

Engineering with Computers, Vol. 26, Iss. 4, 2010-08 ,pp. : 407-418

Springer Publishing Company

Access to resources Recommend Favorite

A surface reconstruction algorithm for topology optimization

By Koguchi Atsushi Kikuchi Noboru

Engineering with Computers, Vol. 22, Iss. 1, 2006-08 ,pp. : 1-10

Springer Publishing Company

Access to resources Recommend Favorite

A Delaunay diagram‐based Min–Max CP‐Tree algorithm for Spatial Data Analysis

WILEY INTERDISCIPLINARY REVIEWS: DATA MINING AND KNOWLEDGE DISCOVERY (ELECTRONIC), Vol. 5, Iss. 3, 2015-05 ,pp. : 142-154

John Wiley & Sons Inc

Access to resources Recommend Favorite

Polygonal surface remeshing with Delaunay refinement

By Dey Tamal Ray Tathagata

Engineering with Computers, Vol. 26, Iss. 3, 2010-06 ,pp. : 289-301

Springer Publishing Company

Access to resources Recommend Favorite

Scheduling in synchronous networks and the greedy algorithm

By Lui K.-S. Zaks S.

Theoretical Computer Science, Vol. 220, Iss. 1, 1999-06 ,pp. : 157-183

Elsevier

Access to resources Recommend Favorite