Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Statistics
  • Help & Advice
University of Warwick

The Library

  • Login

Triangular mesh generation of octrees of non-convex 3D objects

Tools
- Tools
+ Tools

Shin, Dongjoe and Tjahjadi, Tardi (2006) Triangular mesh generation of octrees of non-convex 3D objects. In: 18th International Conference on Pattern Recognition (ICPR 2006), Hong Kong, PEOPLES R CHINA, AUG 20-24, 2006. Published in: 18th International Conference on Pattern Recognition, Vol 3, Proceedings pp. 950-953.

Full text not available from this repository.

Abstract

A general surface-generating algorithm, the Marching Cube, produces triangular meshes from octants where the vertices of octants are clearly classified into either inside or outside the object. However, the algorithm is ambiguous for octrees corresponding to nonconvex objects generated using a Shape from Silhouette technique. This paper presents a methodology which involves Delaunay triangulation to generate surface meshes for such octrees. Since the general 3D Delaunay triangulation creates 3D convex hull which consists of tetrahedron meshes, we propose a method which applies the Delaunay algorithm locally in order to deal with non-convex objects. The proposed method first slices an octree and detects the clusters in each slice. All clusters between adjacent slices are linked based on a 3D probability density cube. The Delaunay algorithm is then applied to locally-linked clusters. Finally the accumulation of triangular meshes forms a final non-convex surface mesh.

Item Type: Conference Item (UNSPECIFIED)
Subjects: Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Series Name: INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION
Journal or Publication Title: 18th International Conference on Pattern Recognition, Vol 3, Proceedings
Publisher: IEEE COMPUTER SOC
ISBN: 0-7695-2521-0
ISSN: 1051-4651
Editor: Tang, YY and Wang, SP and Lorette, G and Yeung, DS and Yan, H
Date: 2006
Number of Pages: 4
Page Range: pp. 950-953
Identification Number: 10.1109/ICPR.2006.1137
Publication Status: Published
Title of Event: 18th International Conference on Pattern Recognition (ICPR 2006)
Location of Event: Hong Kong, PEOPLES R CHINA
Date(s) of Event: AUG 20-24, 2006
URI: http://wrap.warwick.ac.uk/id/eprint/32682

Data sourced from Thomson Reuters' Web of Knowledge

Request changes to a record

Actions (login required)

View Item View Item
twitter

Email us: publications@warwick.ac.uk
Contact Details
About Us