Polyhedral GPU Accelerated Shape from Silhouette

DOI10.1007/978-3-540-89985-3_74zbMATH Open1183.68676OpenAlexW230648954MaRDI QIDQ3628512FDOQ3628512

Authors: Alireza Haghshenas, Mahmoud Fathy, Maryam Mokhtari 

Publication date: 20 May 2009

Published in: Communications in Computer and Information Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-89985-3_74

Recommendations

• Computing with non-convex polyhedra on the GPU
• On incremental rendering of silhouette maps of a polyhedral scene
• scientific article; zbMATH DE number 1445394

zbMATH Keywords

GPU accelerationpolyhedronshape from silhouettepolyhedron intersectionpolyhedron clipping

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Computer science aspects of computer-aided design (68U07)

Cites Work

• DeWall: a fast divide and conquer Delaunay triangulation algorithm in \(E^d\).
• Reentrant polygon clipping
• The Union of Convex Polyhedra in Three Dimensions
• An Optimal Algorithm for Intersecting Three-Dimensional Convex Polyhedra
• A theory of shape by space carving
• Visual modelling: from images to images

Cited In (7)

• Shape from silhouette using Dempster-Shafer theory
• Title not available (Why is that?)
• Mathematical Foundations of Computer Science 2004
• Title not available (Why is that?)
• Efficient perspective-accurate silhouette computation and applications
• Finding Mold-Piece Regions Using Computer Graphics Hardware
• Hardware generated object silhouettes

This page was built for publication: Polyhedral GPU Accelerated Shape from Silhouette

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3628512)