Fast intersections for subdivision surfaces

Authors:
Aaron Severn;Faramarz Samavati
Affiliations:
Department of Computer Science, University of Calgary;Department of Computer Science, University of Calgary
Venue:
ICCSA'06 Proceedings of the 6th international conference on Computational Science and Its Applications - Volume Part I
Year:
2006

Citing 15
Cited 1

Fast constructive-solid geometry display in the pixel-powers graphics system

SIGGRAPH '86 Proceedings of the 13th annual conference on Computer graphics and interactive techniques
Robust and efficient surface intersection for solid modeling

Robust and efficient surface intersection for solid modeling
Fast collision detection of moving convex polyhedra

Graphics gems IV
Piecewise smooth surface reconstruction

SIGGRAPH '94 Proceedings of the 21st annual conference on Computer graphics and interactive techniques
An efficient surface intersection algorithm based on lower-dimensional formulation

ACM Transactions on Graphics (TOG)
Interactive Boolean operations for conceptual design of 3-D solids

Proceedings of the 24th annual conference on Computer graphics and interactive techniques
Subdivision surfaces in character animation

Proceedings of the 25th annual conference on Computer graphics and interactive techniques
Efficient and accurate B-rep generation of low degree sculptured solids using exact arithmetic: I—representations

Computer Aided Geometric Design
Efficient and accurate B-rep generation of low degree sculptured solids using arithmetic: II—computation

Computer Aided Geometric Design
Approximate Boolean operations on free-form solids

Proceedings of the 28th annual conference on Computer graphics and interactive techniques
Minimal hierarchical collision detection

VRST '02 Proceedings of the ACM symposium on Virtual reality software and technology
Normal bounds for subdivision-surface interference detection

Proceedings of the conference on Visualization '01
Analysis and application of subdivision surfaces

Analysis and application of subdivision surfaces
A graph based algorithm for intersection of subdivision surfaces

ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartIII
Trimming for subdivision surfaces

Computer Aided Geometric Design

Beyond Catmull–Clark? A Survey of Advances in Subdivision Surface Methods

Computer Graphics Forum

Quantified Score

Hi-index	0.00

Visualization

Abstract

Subdivision surface intersections can be costly to compute. They require the intersection of high resolution meshes in order to obtain accurate results, which can lead to slow performance and high memory usage. In this paper we show how the strong convex hull property can lead to a method for efficiently computing intersections at high resolutions. Consequently, the method can be used with any subdivision scheme that has the strong convex hull property. In this method, a bipartite graph structure is used to track potentially intersecting faces.