Surface patches from unorganized space curves

Computer Graphics Forum

Volumn 30, Issue 5, 2011, Pages 1379-1387

  Abbasinejad, Fatemeh ^a   Joshi, Pushkar ^b   Amenta, Nina ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b ADOBE RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LINEAR ALGEBRA;

INTELLIGENT USER INTERFACES; MOUSE CLICKS; NON-MANIFOLDS; PIECEWISE SMOOTH SURFACE; SEMI-AUTOMATICS; SKETCH TOOLS; SPACE CURVE; SURFACE PATCHES;

USER INTERFACES;

EID: 84907186594     PISSN: 01677055     EISSN: 14678659     Source Type: Journal    
DOI: 10.1111/j.1467-8659.2011.02012.x     Document Type: Article

References (28)

1. AGARWAL S. C, WAGGENSPACK W. N.: Decomposition method for extracting face topologies from wireframe models. Computer-Aided Design 24, 3 (1992), 123-140.
2. BAE S.-H.,BALAKRISHNAN R., SINGH K.: Ilovesketch: as-natural-as-possible sketching system for creating 3d curve models. In Proceedings of the 21st annual ACM Symposium on User Interface Software and Technology (New York, NY, USA, 2008), UIST'08, ACM, pp. 151-160.
3. BREWER III J. A., COURTER S. M.: Automated conversion of curvilinear wire-frame models to surface boundary models; a topological approach. In Proceedings of of ACM SIGGRAPH 1986 (New York, NY, USA, 1986), SIGGRAPH'86, ACM, pp. 171-178.
4. BERGER F., GRITZMANN P., DE VRIES S.: Minimum cycle bases for network graphs. Algorithmica 40 (June 2004), 51-62.
5. BRAZIL E. V., MACEDO I., SOUSA M. C, DE FIGUEIREDO L. H., VELHO L.: Sketching variational hermite-rbf implicits. In Proceedings of the Seventh Sketch-Based Interfaces and Modeling Symposium (Aire-la-Ville, Switzerland, Switzerland, 2010), SBIM'10, Eurographics Association, pp. 1-8.
6. BOBENKO A. I., SCHRÖDER P.: Discrete willmore flow. In Proceedings of the third Eurographics Symposium on Geometry processing (Aire-la-Ville, Switzerland, Switzerland, 2005), SGP '05, Eurographics Association, pp. 101-110.
7. BAGALI S., WAGGENSPACK JR. W. N.: A shortest path approach to wireframe to solid model conversion. In Proceedings of the third ACM Symposium on Solid modeling and applications (New York, NY, USA, 1995), SMA '95, ACM, pp. 339-350.
8. DUTTON R. D., BRIGHAM R. C: Efficiently identifying the faces of a solid. Computers & Graphics in Mechanical Engineering 7, 2 (1983), 143-147.
9. DE PINA J.: Applications of Shortest Path Methods. PhD thesis, University of Amsterdam, 1995.
10. EDESBRUNNER H., HARER J.: Persistent homology - a survey. In Surveys on Discrete and Computational Geometry: Twenty Years Later, no. 453 in Contemporary Mathematics. American Mathematical Society, 2008.
11. GOLYNSKI A., HORTON J.: A polynomial time algorithm to find the minimum cycle basis of a regular matroid. In Proceedings of the 8th Scandinavian Workshop on Algorithm Theory (2002), Penttonen M., Schmidt E. M., (Eds.), no. 2368 in SWAT '02, Springer Berlin / Heidelberg, pp. 200-209.
12. GANTER M. A., UICKER J. J.: From Wire-Frame to solid geometric: Automated conversion of data representations. Computers in Mechanical Engineering 2 (sept 1983), 40-45.
13. HANRAHAN P. M.: Creating volume models from edge-vertex graphs. In Proceedings of ACM SIGGRAPH 1982 (New York, NY, USA, 1982), SIGGRAPH '82, ACM, pp. 77-84.
14. INOUE K., SHIMADA K., CHILAKA K.: Solid model reconstruction of wireframe cad models based on topological em-beddings of planar graphs. Journal of Mechanical Design 125, 3 (2003), 434-442.
15. JEAN-GUILLAUME DUMAS P. G., PERNET C.: Ffpack: Finite field linear algebra package. In ISSAC: International Symposium on Symbolic and Algebraic Computations (2004).
16. KAVITHA T., MEHLHORN K., MICHAIL D., PALUCH K.: A faster algorithm for minimum cycle basis of graphs. In Automata, Languages and Programming (2004), et al. J. D., (Ed.), Vol. 3142 of Lecture Notes in Computer Science, Springer Berlin / Heidelberg, pp. 97-109.
17. LAWLER E.: Combinatorial Optimization: Networks and Matroids. Holt, Reinhart and Winston, 1976.
18. LIU J., LEE Y. T.: Graph-based method for face identification from a single 2d line drawing. Pattern Analysis and Machine Intelligence, IEEE Transactions on 23, 10 (oct 2001), 1106-1119.
19. LIU J., LEE Y. T., CHAM W.-K.: Identifying faces in a 2d line drawing representing a manifold object. Pattern Analysis and Machine Intelligence, IEEE Transactions on 24, 12 (dec 2002), 1579-1593.
20. LIEBCHEN C., RIZZI R.: A greedy approach to compute a minimum cycle basis of a directed graph. Information Processing Letters 94, 3 (2005), 107-112.
21. MARKOWSKY G., WESLEY M. A.: Fleshing out wire frames. IBM J. Res. Dev. 24 (September 1980), 582-597.
22. MEHRA R., ZHOU Q., LONG J., SHEFFER A., GOOCH A., MITRA N. J.: Abstraction of man-made shapes. In Proceedings of ACM SIGGRAPH Asia 2009 (New York, NY, USA, 2009), SIGGRAPH Asia '09, ACM, pp. 137:1-137:10.
23. SHEWCHUK J. R.: Triangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator. In Applied Computational Geometry: Towards Geometric Engineering, Vol. 1148 of Lecture Notes in Computer Science. Springer-Verlag, May 1996, pp. 203-222. From the First ACM Workshop on Applied Computational Geometry.
24. SCHMIDT R., KHAN A., SINGH K., KURTENBACH G.: Analytic drawing of 3D scaffolds. In Proceedings of ACM SIGGRAPH Asia 2009 (New York, NY, USA, 2009), SIGGRAPH Asia '09, ACM, pp. 149:1-149:10.
25. SHPITALNI M., LIPSON H.: Identification of faces in a 2D line drawing projection of a wireframe object. Pattern Analysis and Machine Intelligence, IEEE Transactions on 18, 10 (oct 1996), 1000-1012.
26. SUN Y., LEE Y. T.: Topological analysis of a single line drawing for 3d shape recovery. In Proceedings of the 2nd international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2004), GRAPHITE '04, pp. 167-172.
27. VARLEY P. A., COMPANY P. P.: A new algorithm for finding faces in wireframes. Computer-Aided Design 42, 4 (2010), 279-309.
28. WESCHE G., SEIDEL H.-P.: Freedrawer: a free-form sketching system on the responsive workbench. In Proceedings of the ACM Symposium on Virtual reality software and technology (New York, NY, USA, 2001), VRST '01, ACM, pp. 167-174.