Journal Article10.1109/MCG.1984.275874
A Method for Solving the Visibility Problem
22
TL;DR: Faster solutions to 3-D visibility problems and better distribution of multiprocessor systems can be achieved when this new connectivity data algorithm is used.
read more
Abstract: Faster solutions to 3-D visibility problems and better distribution of multiprocessor systems can be achieved when this new connectivity data algorithm is used.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
As-rigid-as-possible shape manipulation
Takeo Igarashi,Tomer Moscovich,John Hughes +2 more
- 01 Jul 2005
TL;DR: An interactive system that lets a user move and deform a two-dimensional shape without manually establishing a skeleton or freeform deformation (FFD) domain beforehand and uses quadratic error metrics so that each minimization problem becomes a system of linear equations.
Model-Based 3D Hand Pose Estimation from Monocular Video
TL;DR: A novel model-based approach to 3D hand tracking from monocular video is presented, which introduces new occlusion forces and shows that using all gradient terms greatly improves the performance of the method.
Patent
Visibility calculations for 3D computer graphics
Hong Lip Lim
- 19 Jun 1992
TL;DR: In this article, a fuzzy projection of a surface (SU) as seen from a number of viewpoints (VP) in a bounding box (BB) is stored in a buffer having elements (FE).
118
Hidden curve removal for free form surfaces
Gershon Elber,Elaine Cohen +1 more
- 01 Sep 1990
TL;DR: A technique is described to extract the visible curves for a given scene without the need to approximate the surface by polygons, producing higher quality results than polygon based algorithms, as most of the output set has an exact representation.
87
References
A Characterization of Ten Hidden-Surface Algorithms
TL;DR: The paper shows that the order of sorting and the types of sorting used form differences among the existing hidden-surface algorithms.
927
A real time visible surface algorithm
Gary Scott Watkins
- 01 Jan 1970
TL;DR: The dissertation describes an algorithm designed for a hardware processor capable of displaying solid objects, and a FORTRAN 5 program for simulating the hardware processor.
241
Simulation and expected performance analysis of multiple processor Z-buffer systems
Frederic I. Parke
- 01 Jul 1980
TL;DR: The analyses and simulations indicate that substantial gain is possible by applying multiple processors to the task, but, as more and more processors are added, additional gains in performance become smaller and smaller, which suggests optimal system sizes.
89
Parallel processing techniques for hidden surface removal
Michael Kaplan,Donald P. Greenberg +1 more
- 01 Aug 1979
TL;DR: This paper investigates two existing algorithmic approaches to the hidden-surface problem with a view towards their applicability to implementation on a parallel machine organization and indicates the difficulties stemming from a loss of coherence and imply potentially important design criteria for a parallel configuration.
47
An approach to a calculation-minimized hidden line algorithm☆
TL;DR: In this article, the authors proposed a method to recognize complete visible areas instead of single visible edges, and compared it with other techniques, showing the qualitatively better calculation rate of the new method.
19