Worst-case optimal hidden-surface removal
ACM Transactions on Graphics (TOG)
An enhanced treatment of hidden lines
ACM Transactions on Graphics (TOG)
Hidden-line algorithm for curved surfaces
Computer-Aided Design
An efficient algorithm for hidden surface removal
SIGGRAPH '89 Proceedings of the 16th annual conference on Computer graphics and interactive techniques
Computer graphics: principles and practice (2nd ed.)
Computer graphics: principles and practice (2nd ed.)
Hidden curve removal for free form surfaces
SIGGRAPH '90 Proceedings of the 17th annual conference on Computer graphics and interactive techniques
Hidden curve elimination of trimmed surfaces using Be´zier clipping
CG International '92 Proceedings of the 10th International Conference of the Computer Graphics Society on Visual computing : integrating computer graphics with computer vision: integrating computer graphics with computer vision
A Characterization of Ten Hidden-Surface Algorithms
ACM Computing Surveys (CSUR)
An improved illumination model for shaded display
Communications of the ACM
A procedure for generation of three-dimensional half-toned computer graphics presentations
Communications of the ACM
An algorithm for hidden line elimination
Communications of the ACM
Geometric constraint solver using multivariate rational spline functions
Proceedings of the sixth ACM symposium on Solid modeling and applications
Hidden surface removal using polygon area sorting
SIGGRAPH '77 Proceedings of the 4th annual conference on Computer graphics and interactive techniques
Dual contouring of hermite data
Proceedings of the 29th annual conference on Computer graphics and interactive techniques
Problem Reduction to Parameter Space
Proceedings of the 9th IMA Conference on the Mathematics of Surfaces
The notion of quantitative invisibility and the machine rendering of solids
ACM '67 Proceedings of the 1967 22nd national conference
Hidden Surface Removal Algorithms for Curved Surfaces
Hidden Surface Removal Algorithms for Curved Surfaces
A subdivision algorithm for computer display of curved surfaces.
A subdivision algorithm for computer display of curved surfaces.
Two-Dimensional Visibility Charts for Continuous Curves
SMI '05 Proceedings of the International Conference on Shape Modeling and Applications 2005
Contouring 1- and 2-Manifolds in Arbitrary Dimensions
SMI '05 Proceedings of the International Conference on Shape Modeling and Applications 2005
A Method for Solving the Visibility Problem
IEEE Computer Graphics and Applications
A Solution to the Hidden-Line Problem for Computer-Drawn Polyhedra
IEEE Transactions on Computers
Computing surface offsets and bisectors using a sampled constraint solver
Proceedings of Graphics Interface 2009
Critical point analysis using domain lifting for fast geometry queries
Computer-Aided Design
Computer-Aided Design
| Hi-index | 0.00 |
We present an efficient and robust algorithm for computing continuous visibility for two- or three-dimensional shapes whose boundaries are NURBS curves or surfaces by lifting the problem into a higher dimensional parameter space. This higher dimensional formulation enables solving for the visible regions over all view directions in the domain simultaneously, therefore providing a reliable and fast computation of the visibility chart, a structure which simultaneously encodes the visible part of the shape's boundary from every view in the domain. In this framework, visible parts of planar curves are computed by solving two polynomial equations in three variables (t and r for curve parameters and θ for a view direction). Since one of the two equations is an inequality constraint, this formulation yields two-manifold surfaces as a zero-set in a 3-D parameter space. Considering a projection of the two-manifolds onto the tθ-plane, a curve's location is invisible if its corresponding parameter belongs to the projected region. The problem of computing hidden curve removal is then reduced to that of computing the projected region of the zero-set in the tθ-domain. We recast the problem of computing boundary curves of the projected regions into that of solving three polynomial constraints in three variables, one of which is an inequality constraint. A topological structure of the visibility chart is analyzed in the same framework, which provides a reliable solution to the hidden curve removal problem. Our approach has also been extended to the surface case where we have two degrees of freedom for a view direction and two for the model parameter. The effectiveness of our approach is demonstrated with several experimental results.