Filling gaps in the boundary of a polyhedron
Computer Aided Geometric Design
SKETCH: an interface for sketching 3D scenes
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Teddy: a sketching interface for 3D freeform design
Proceedings of the 26th annual conference on Computer graphics and interactive techniques
FreeDrawer: a free-form sketching system on the responsive workbench
VRST '01 Proceedings of the ACM symposium on Virtual reality software and technology
Lofting curve networks using subdivision surfaces
Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing
ShapeShop: sketch-based solid modeling with BlobTrees
ACM SIGGRAPH 2006 Courses
Automatic Hole-Filling of Triangular Meshes Using Local Radial Basis Function
3DPVT '06 Proceedings of the Third International Symposium on 3D Data Processing, Visualization, and Transmission (3DPVT'06)
FiberMesh: designing freeform surfaces with 3D curves
ACM SIGGRAPH 2007 papers
Atomic volumes for mesh completion
SGP '05 Proceedings of the third Eurographics symposium on Geometry processing
Developable surfaces from arbitrary sketched boundaries
SGP '07 Proceedings of the fifth Eurographics symposium on Geometry processing
ILoveSketch: as-natural-as-possible sketching system for creating 3d curve models
Proceedings of the 21st annual ACM symposium on User interface software and technology
Analytic drawing of 3D scaffolds
ACM SIGGRAPH Asia 2009 papers
ACM SIGGRAPH 2010 papers
Sketching Variational Hermite-RBF implicits
Proceedings of the Seventh Sketch-Based Interfaces and Modeling Symposium
Just DrawIt: a 3D sketching system
Proceedings of the International Symposium on Sketch-Based Interfaces and Modeling
Design-driven quadrangulation of closed 3D curves
ACM Transactions on Graphics (TOG) - Proceedings of ACM SIGGRAPH Asia 2012
| Hi-index | 0.00 |
3D sketching is an appealing approach for creating concept shapes in the early stages of design. While curve networks alone can convey shape, surfacing the network can dramatically help with visualization and interaction. Unfortunately, surfacing a curve network is an inherently ambiguous problem, and even if the correct surface patches are identified, they can have an arbitrarily complex 3D geometry, making it challenging to produce a reasonable tessellation. In this paper we address the problem of creating light-weight surface tessellations on the fly. Our approach is to identify potential patches in the curve network, and then break complicated patches into simpler ones which can be tessellated using any simple algorithm. Our surfacing approach relies on the observation that breaking a complicated patch into a set of nearly planar ones with small total area seems to create a simple, natural-looking surfaces. We demonstrate our approach on curve networks generated by two different 3D sketching systems.