{"title":"Model-based matching and hinting of fonts","authors":"R. Hersch, C. Bétrisey","doi":"10.1145/122718.122726","DOIUrl":"https://doi.org/10.1145/122718.122726","url":null,"abstract":"In today's digital computers, phototypesetters and printers, typographic fonts are mainly given by their outline descriptions. Outline descriptions alone do not provide any information about character parts like stems serifs, shoulders, and bowls. But, in order to produce the best looking characters at a given size on a specific printer, non-linear operations must be applied to parts of the character shape. At low-resolution, grid-fitting of character outlines is required for generating nice and regular raster characters. For this reason, grid-fitting rules called hints are added to the character description. Grid-fitting rules require as parameters certain characteristic points within the shape outlines. In order to be able to detect these characteristic points in any given input font, a topological model representing the essence of the shapes found in typographic latin typefaces is proposed. This model includes sufficient information for matching existing non-fancy outline fonts to the model description. For automatic hint generation, a table of applicable hints is added into the topological model description. After matching a given input shape to the model, hints which can be applied to the shape of the given font are taken and added to its outline description. Furthermore, a structural description of individual letter shape parts using characteristic model points can be added to the model. Such a description provides knowledge about typographic structure elements like stems, serifs and bowls.","PeriodicalId":103540,"journal":{"name":"Proceedings of the 18th annual conference on Computer graphics and interactive techniques","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122452253","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Generating textures on arbitrary surfaces using reaction-diffusion","authors":"Greg Turk","doi":"10.1145/122718.122749","DOIUrl":"https://doi.org/10.1145/122718.122749","url":null,"abstract":"This paper describes a biologically motivated method of texture synthesis called reaction-diffusion and demonstrates how these textures can be generated in a manner that directly matches the geometry of a given surface. Reaction-diffusion is a process in which two or more chemicals diffuse at unequal rates over a surface and react with one another to form stable patterns such as spots and stripes. Biologists and mathematicians have explored the patterns made by several reaction-diffusion systems. We extend the range of textures that have previously been generated by using a cascade of multiple reaction-diffusion systems in which one system lays down an initial pattern and then one or more later systems refine the pattern. Examples of patterns generated by such a cascade process include the clusters of spots on leopards known as rosettes and the web-like patterns found on giraffes. In addition, this paper introduces a method which reaction-diffusion textures are created to match the geometry of an arbitrary polyhedral surface. This is accomplished by creating a mesh over a given surface and then simulating the reaction-diffusion process directly on this mesh. This avoids the often difficult task of assigning texture coordinates to a complex surface. A mesh is generated by evenly distributing points over the model using relaxation and then determining which points are adjacent by constructing their Voronoi regions. Textures are rendered directly from the mesh by using a weighted sum of mesh values to compute surface color at a given position. Such textures can also be used as bump maps.","PeriodicalId":103540,"journal":{"name":"Proceedings of the 18th annual conference on Computer graphics and interactive techniques","volume":"132 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128766448","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Animation aerodynamics","authors":"J. Wejchert, D. Haumann","doi":"10.1145/122718.122719","DOIUrl":"https://doi.org/10.1145/122718.122719","url":null,"abstract":"Methods based on aerodynamics are developed to simulate and control the motion of objects in fluid flows. To simplify the physics for animation, the problem is broken down into two parts: a fluid flow regime and an object boundary regime. With this simplification one can approximate the realistic behaviour of objects moving in liquids or air. It also enables a simple way of designing and controlling animation sequences: from a set of flow primitives, an animator can design the spatial arrangement of flows, create flows around obstacles and direct flow timing. The approach is fast, simple, and is easily fitted into simulators that model objects governed by classical mechanics. The methods are applied to an animation that involves hundreds of flexible leaves being blown by wind currents.","PeriodicalId":103540,"journal":{"name":"Proceedings of the 18th annual conference on Computer graphics and interactive techniques","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121584665","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An efficient antialiasing technique","authors":"Xiaolin Wu","doi":"10.1145/122718.122734","DOIUrl":"https://doi.org/10.1145/122718.122734","url":null,"abstract":"An intuitive concept of antialiasing is developed into very efficient antialiased line and circle generators that require even less amount of integer arithmetic than Bresenham's line and circle algorithms. Unlike its predecessors, the new antialiasing technique is derived in spatial domain (raster plane) under a subjectively meaningful error measure to preserve the dynamics of curve and object boundaries. A formal analysis of the new antialiasing technique in frequency domain is also conducted. It is shown that our antialiasing technique computes the same antialiased images as Fujimoto-Iwata's algorithm but at a fraction of the latter's computational cost. The simplicities of the new antialiased line and circle generators also mean their easy hardware implementations.","PeriodicalId":103540,"journal":{"name":"Proceedings of the 18th annual conference on Computer graphics and interactive techniques","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123393993","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
James V. Miller, D. Breen, W. Lorensen, Robert M. O'Bara, M. Wozny
{"title":"Geometrically deformed models: a method for extracting closed geometric models form volume data","authors":"James V. Miller, D. Breen, W. Lorensen, Robert M. O'Bara, M. Wozny","doi":"10.1145/122718.122742","DOIUrl":"https://doi.org/10.1145/122718.122742","url":null,"abstract":"We propose a new approach to the problem of generating a simple topologically-closed geometric model from a point-sampled volume data set. We call such a model a Geometrically Deformed Model or GDM. A GDM is created by placing a 'seed' model in the volume data set. The model is then deformed by a relaxation process that minimizes a set of constraints that provides a measure of how well the model fits the features in the data. Constraints are associated with each vertex in the model that control local deformation, interaction between the model and the data set, and the shape and topology of the model. Once generated, a GDM can be used for visualization, shape recognition, geometric measurements, or subjected to a series of geometric operations. This technique is of special importance because of the advent of nondestructive sensing equipment (CT, MRI) that generates point samples of true three-dimensional objects.","PeriodicalId":103540,"journal":{"name":"Proceedings of the 18th annual conference on Computer graphics and interactive techniques","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125521576","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Computer animation of knowledge-based human grasping","authors":"H. Rijpkema, M. Girard","doi":"10.1145/122718.122754","DOIUrl":"https://doi.org/10.1145/122718.122754","url":null,"abstract":"The synthesis of human hand motion and grasping of arbitrary shaped objects is a very complex problem. Therefore high-level control is needed to perform these actions. In order to satisfy the kinematic and physical constraints associated with the human hand and to reduce the enormous search space associated with the problem of grasping objects, a knowledge based approach is used. A three-phased scheme is presented which incorporates the role of the hand, the object, the environment and the animator. The implementation of a hand simulation system HANDS is discussed.","PeriodicalId":103540,"journal":{"name":"Proceedings of the 18th annual conference on Computer graphics and interactive techniques","volume":"202 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116601150","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Reaction-diffusion textures","authors":"A. Witkin, M. Kass","doi":"10.1145/122718.122750","DOIUrl":"https://doi.org/10.1145/122718.122750","url":null,"abstract":"We present a method for texture synthesis based on the simulation of a process of local nonlinear interaction, called reaction-diffusion, which has been proposed as a model of biological pattern formation. We extend traditional reaction-diffusion systems by allowing anisotropic and spatially non-uniform diffusion, as well as multiple competing directions of diffusion. We adapt reaction-diffusion system to the needs of computer graphics by presenting a method to synthesize patterns which compensate for the effects of non-uniform surface parameterization. Finally, we develop efficient algorithms for simulating reaction-diffusion systems and display a collection of resulting textures using standard texture- and displacement-mapping techniques.","PeriodicalId":103540,"journal":{"name":"Proceedings of the 18th annual conference on Computer graphics and interactive techniques","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133095696","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Piecewise surface flattening for non-distorted texture mapping","authors":"C. Bennis, J. Vézien, G. Iglésias","doi":"10.1145/122718.122744","DOIUrl":"https://doi.org/10.1145/122718.122744","url":null,"abstract":"This paper introduces new techniques for interactive piecewise flattening of parametric 3-D surfaces, leading to a non-distorted, hence realistic, texture mapping. Cuts are allowed on the mapped texture and we make a compromise between discontinuities and distortions. These techniques are based on results from differential geometry, more precisely on the notion of \"geodesic curvature\": isoparametric curves of the surface are mapped, in a constructive way, onto curves in the texture plane with preservation of geodesic curvature at each point. As an application, we give a concrete example which is a first step towards an efficient and robust CAD tool for shoe modeling.","PeriodicalId":103540,"journal":{"name":"Proceedings of the 18th annual conference on Computer graphics and interactive techniques","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133403746","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Hierarchical splatting: a progressive refinement algorithm for volume rendering","authors":"D. Laur, P. Hanrahan","doi":"10.1145/122718.122748","DOIUrl":"https://doi.org/10.1145/122718.122748","url":null,"abstract":"This paper presents a progressive refinement algorithm for volume rendering which uses a pyramidal volume representation. Besides storing average values, the pyramid stores estimated error, so an octtree can be fit to the pyramid given a user-supplied precision. This octtree is then drawn using a set of splats, or footprints, each scaled to match the size of the projection of a cell. The splats themselves are approximated with RGBA Gouraud-shaded polygons, so that they can be drawn efficiently on modern graphics workstations. The result is a real-time rendering algorithm suitable for interactive applications.","PeriodicalId":103540,"journal":{"name":"Proceedings of the 18th annual conference on Computer graphics and interactive techniques","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134339062","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"NC machining with G-buffer method","authors":"Takafumi Saito, Tokiichiro Takahashi","doi":"10.1145/122718.122741","DOIUrl":"https://doi.org/10.1145/122718.122741","url":null,"abstract":"The G-buffer method is applied to NC machining. A total NC system is created that consists of all essential functions, such as tool path generation, path verification, and feed rate control. Moreover, any combination of object surface and tool shape is acceptable. By utilizing G-buffers created from a parallel projection, the required NC functions are realized as image processing operations. This ensures that the NC software is independent from surface description. Conventional rendering software can be used to make the G-buffers. Any surface can be milled if it can be rendered by parallel projection. Tool shape changes can be easily handled by changing the image processing filters. 3D examples of geometric surfaces, mesh data, and volume data are milled with this method, and the results show that the method is very effective.","PeriodicalId":103540,"journal":{"name":"Proceedings of the 18th annual conference on Computer graphics and interactive techniques","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133683598","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}