{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T17:19:35Z","timestamp":1761931175017,"version":"build-2065373602"},"reference-count":28,"publisher":"ASME International","issue":"2","content-domain":{"domain":["asmedigitalcollection.asme.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2003,6,1]]},"abstract":"<jats:p>Based on the depth-sorting hidden-line removal algorithm, new methods of producing silhouette and raised level-curve diagrams with the hidden-lines removed of single-valued functions of two variables are presented. An algorithm of generating accurate truncated representations over the z-axis of the same types of functions is also described. These methods are particularly advantageous when plotting multimodal functions, noisy data or penalized objective functions encountered in optimization problems. Since all the graphic operations are performed entirely in the 2D image-space, the methods presented are suitable for implementation in low memory hardware like hand-held calculators and field instruments.<\/jats:p>","DOI":"10.1115\/1.1576809","type":"journal-article","created":{"date-parts":[[2003,7,7]],"date-time":"2003-07-07T14:52:13Z","timestamp":1057589533000},"page":"136-143","update-policy":"https:\/\/doi.org\/10.1115\/crossmarkpolicy-asme","source":"Crossref","is-referenced-by-count":2,"title":["Improved Display Methods of Single-valued Functions of Two Variables"],"prefix":"10.1115","volume":"3","author":[{"given":"P. A.","family":"Simionescu","sequence":"first","affiliation":[{"name":"Auburn University, Department of Mechanical Engineering, 202 Ross Hall, Auburn University, AL 36849"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"33","published-online":{"date-parts":[[2003,6,30]]},"reference":[{"key":"2019100523435644200_r1","doi-asserted-by":"crossref","unstructured":"Kubert, B., Szabo, J., and Giulieri, S., 1968, \u201cThe Perspective Representation of Functions of Two Variables,\u201d J. ACM, 2, pp. 193\u2013204.","DOI":"10.1145\/321450.321453"},{"key":"2019100523435644200_r2","doi-asserted-by":"crossref","unstructured":"Williamson, H. , 1972, \u201cAlgorithm 420, Hidden-Line Plotting Program,\u201d Commun. ACM, 15, pp. 100\u2013103.","DOI":"10.1145\/361254.361264"},{"key":"2019100523435644200_r3","doi-asserted-by":"crossref","unstructured":"Wright, T. J. , 1973, \u201cTwo-Space Solution to the Hide Line Problem for Plotting Functions of Two Variables\u201d IEEE Trans. Comput., C22, pp. 28\u201333.","DOI":"10.1109\/T-C.1973.223597"},{"key":"2019100523435644200_r4","doi-asserted-by":"crossref","unstructured":"Watkins, S. L. , 1974, \u201cAlgorithm 483, Masked Three-Dimensional Plot Program With Rotations,\u201d Commun. ACM, 17, pp. 520\u2013523.","DOI":"10.1145\/361147.361112"},{"key":"2019100523435644200_r5","doi-asserted-by":"crossref","unstructured":"Butland, J. , 1979, \u201cSurface Drawing Made Simple,\u201d Comput.-Aided Des., 11, pp. 19\u201322.","DOI":"10.1016\/0010-4485(79)90005-8"},{"key":"2019100523435644200_r6","doi-asserted-by":"crossref","unstructured":"Boese, F. G. , 1988, \u201cSurface Drawing Made Simple But Not too Simple,\u201d Comput.-Aided Des., 20, pp. 249\u2013258.","DOI":"10.1016\/0010-4485(88)90070-X"},{"key":"2019100523435644200_r7","doi-asserted-by":"crossref","unstructured":"Sowerbutts, W. T. C. , 1983, \u201cA Surface-Plotting Program Suitable for Microcomputers,\u201d Comput.-Aided Des., 15, pp. 324\u2013327.","DOI":"10.1016\/0010-4485(83)90001-5"},{"key":"2019100523435644200_r8","doi-asserted-by":"crossref","unstructured":"Gordon, D. , 2002, \u201cThe Floating Column Algorithm for Shaded, Parallel Display of Function Surfaces Without Patches,\u201d IEEE Trans. Vis. Comput. Graph., 8, pp. 76\u201391.","DOI":"10.1109\/2945.981853"},{"key":"2019100523435644200_r9","unstructured":"Foley, J. D., van Dam, A., Feiner, S. K., and Hughes, J. F., 1996, Computer Graphics: Principles and Practice Addison-Wesley, 651\u2013656."},{"key":"2019100523435644200_r10","doi-asserted-by":"crossref","unstructured":"Dayhoff, M. O. , 1963, \u201cA Contour-Map Program for X-ray Crystallography,\u201d Commun. ACM, 6, pp. 620\u2013622.","DOI":"10.1145\/367651.367688"},{"key":"2019100523435644200_r11","unstructured":"Bourke, P. D. , 1987, \u201cA Contouring Subroutine,\u201d BYTE, pp. 143\u2013150."},{"key":"2019100523435644200_r12","doi-asserted-by":"crossref","unstructured":"Encarnacao, J. L., Lindner, R., and Schlechtendahl, E. G., 1990, Computer Aided Design: Fundamentals and System Architecture, Springer-Verlag, pp. 335\u2013342.","DOI":"10.1007\/978-3-642-84054-8"},{"key":"2019100523435644200_r13","unstructured":"Thomas, A. L., 1997, \u201cContouring Algorithms for Visualization and Shape Modeling Systems,\u201d in Visualization and Modeling (R. Ernshaw et al., eds.) Academic Press, pp. 99\u2013175."},{"key":"2019100523435644200_r14","doi-asserted-by":"crossref","unstructured":"Newell, M. E., Newell, R. G., and Sancha, T. L., 1972, \u201cA Solution to the Hidden Surface Problem,\u201d Proceedings of the ACM National Meeting, pp. 443\u2013450.","DOI":"10.1145\/569951.569954"},{"key":"2019100523435644200_r15","unstructured":"Hern, D., and Baker, M. P., 1997, Computer Graphics: C Version, Prentice-Hall, pp. 478\u2013481."},{"key":"2019100523435644200_r16","doi-asserted-by":"crossref","unstructured":"Patrikalakis, N. M. , 1993, \u201cSurface-to-Surface Intersections,\u201d IEEE Comput. Graphics Appl., 13, pp. 89\u201395.","DOI":"10.1109\/38.180122"},{"key":"2019100523435644200_r17","unstructured":"Simionescu, P. A., and Beale D., 2001, \u201cA Software for Graphical Representation of Objective Functions,\u201d Artificial Neural Networks in Engineering Conference (ANNIE), St. Louis, MO, November 4\u20137."},{"key":"2019100523435644200_r18","unstructured":"Rogers, D. F., 1985, Procedural Elements for Computer Graphics, McGraw-Hill, 191\u2013205."},{"key":"2019100523435644200_r19","doi-asserted-by":"crossref","unstructured":"Lorensen, W., and Cline, H., 1987, \u201cMarching Cubes: A High Resolution 3D Surface Construction Algorithm,\u201d Comput. Graph., 21, pp. 163\u2013170.","DOI":"10.1145\/37402.37422"},{"key":"2019100523435644200_r20","doi-asserted-by":"crossref","unstructured":"Nielson, G. M., and Hamann, B., 1991, \u201cThe Asymptotic Decider: Resolving the Ambiguity in Marching Cubes,\u201d Proc. of the IEEE Visualization Conference, pp. 83\u201390.","DOI":"10.1109\/VISUAL.1991.175782"},{"key":"2019100523435644200_r21","doi-asserted-by":"crossref","unstructured":"Van Gelder, A., and Wilhelms, J., 1994, \u201cTopological Considerations in Isosurface Generation,\u201d ACM Trans. Graphics, 13, pp. 337\u2013375.","DOI":"10.1145\/195826.195828"},{"key":"2019100523435644200_r22","doi-asserted-by":"crossref","unstructured":"Natarajan, B. K. , 1994, \u201cOn Generating Topologically Consistent Isosurfaces From Uniform Samples,\u201d Visual Comput., 11, pp. 52\u201362.","DOI":"10.1007\/BF01900699"},{"key":"2019100523435644200_r23","unstructured":"Brent, R. P., 1973, Algorithms of Minimization Without Derivatives, Prentice-Hall, New York."},{"key":"2019100523435644200_r24","doi-asserted-by":"crossref","unstructured":"Anderson, D. P. , 1982, \u201cHidden-Line Elimination in Projected Grid Surfaces,\u201d ACM Trans. Graphics, 1, pp. 274\u2013288.","DOI":"10.1145\/357311.357313"},{"key":"2019100523435644200_r25","doi-asserted-by":"crossref","unstructured":"Kohl, H. W. , 1996, \u201cHidden-Curve Algorithm for Correct Grid Surface Representation of Functions of Two Variables,\u201d Comput. Graphics, 20, pp. 243\u2013261.","DOI":"10.1016\/0097-8493(95)00099-2"},{"key":"2019100523435644200_r26","doi-asserted-by":"crossref","unstructured":"Simionescu, P. A., and Smith, M. R., 2000, \u201cSingle Valued Functions Graphical Representations in Linkage Mechanisms Design,\u201d Mech. Mach. Theory, 35, pp. 1709\u20131726.","DOI":"10.1016\/S0094-114X(00)00018-5"},{"key":"2019100523435644200_r27","doi-asserted-by":"crossref","unstructured":"Simionescu, P. A., and Beale, D., 2002, \u201cNew Concepts in Graphic Visualization of Objective Functions,\u201d Proceedings of The ASME Design Engineering Technical Conferences and Computers and Information in Engineering Conference, Montreal, September 29\u2013October 2.","DOI":"10.1115\/DETC2002\/DAC-34129"},{"key":"2019100523435644200_r28","doi-asserted-by":"crossref","unstructured":"Patnaik, L. M., Shenoy, R. S., and Krishnan, D., 1986, \u201cSet Theoretic Operations on Polygons Using the Scan-Grid Approach,\u201d Comput.-Aided Des., 18, pp. 275\u2013279.","DOI":"10.1016\/0010-4485(86)90297-6"}],"container-title":["Journal of Computing and Information Science in Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/asmedigitalcollection.asme.org\/computingengineering\/article-pdf\/3\/2\/136\/5773271\/136_1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"http:\/\/asmedigitalcollection.asme.org\/computingengineering\/article-pdf\/3\/2\/136\/5773271\/136_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,13]],"date-time":"2024-12-13T04:36:37Z","timestamp":1734064597000},"score":1,"resource":{"primary":{"URL":"https:\/\/asmedigitalcollection.asme.org\/computingengineering\/article\/3\/2\/136\/460123\/Improved-Display-Methods-of-Singlevalued-Functions"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,6,1]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,6,1]]}},"URL":"https:\/\/doi.org\/10.1115\/1.1576809","relation":{},"ISSN":["1530-9827","1944-7078"],"issn-type":[{"type":"print","value":"1530-9827"},{"type":"electronic","value":"1944-7078"}],"subject":[],"published":{"date-parts":[[2003,6,1]]}}}