{"title":"Discrete models for geometric objects","authors":"P. Brunet","doi":"10.1145/566282.566285","DOIUrl":"https://doi.org/10.1145/566282.566285","url":null,"abstract":"This lecture presents and discusses the use of discrete models for modeling geometric objects. Discrete models (voxel representations, octrees, KD-trees, interval solids or even point representations) are emerging as a flexible tool for geometric modeling. These algorithms exploit the trade-off between robustness and memory. The availability at low cost of large amounts of memory affords thus completely robust models. Discrete bands can be used for instance for reconstructing valid closed models from point clouds, and to obtain different kinds of smooth Boundary Representations. On the other hand, discrete representations are specially well suited for error-bounded geometry and topology simplification, being also useful for occlusion culling in the inspection and navigation of very large virtual environments. Basic tools for modeling, surface extraction and visualization, simplification and relaxation will be described, and a number of potential applications will be presented.","PeriodicalId":286112,"journal":{"name":"International Conference on Smart Media and Applications","volume":"318 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114698393","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":"Range-Image segmentation and model reconstruction based on a fit-and-merge strategy","authors":"M. Djebali, Mahmoud Melkemi, N. Sapidis","doi":"10.1145/566282.566303","DOIUrl":"https://doi.org/10.1145/566282.566303","url":null,"abstract":"A segmentation and model-reconstruction algorithm is proposed based on polynomial approximation and on a novel version of \"region growing\". First, an initial partition is calculated on the basis of differential-geometric properties of the range image. Then, the first merging procedure is applied (\"merge with constraints\") aiming at correctly identifying principal surfaces of the model. It examines all possible mergers of regions and selects those satisfying strict compatibility constraints. The second merging procedure relaxes these constraints to produce the final segmentation. Theoretical work is presented proving the consistency of these merging procedures. Finally, application of the algorithm on industrial data is presented demonstrating the efficiency of the proposed methodology.","PeriodicalId":286112,"journal":{"name":"International Conference on Smart Media and Applications","volume":"182 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131880711","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":"Deformation of finite element meshes using directly manipulated free-form deformation","authors":"N. Frisch, T. Ertl","doi":"10.1145/566282.566319","DOIUrl":"https://doi.org/10.1145/566282.566319","url":null,"abstract":"CrashViewer [5, 18] is a tool for visualizing car crash simulation input and output data consisting of nite element meshes. For a shorter work ow, a feature for local deformation of the car components represented by FE meshes is desired. This feature allows to quickly make minor corrections and enhancements directly on the FE mesh. The roundtrip through the CAD department and the remeshing of the CAD representation is avoided. The crash simulation can be started immediately with the modified car component(s). In order to achieve this goal, we investigate a variety of approaches related to free-form deformation (FFD). We base our implementation on the directly manipulated free-form deformation (DMFFD) [8, 7], adding various enhancements to this approach. We improve the deformation behaviour to be more uniform and consistent over time and space, and thus more intuitive and user friendly. Further, we present ways for increasing the efficiency of the computations necessary for mesh deformation. Finally, we specify a simple user interface which is easy to use while providing the necessary precision.","PeriodicalId":286112,"journal":{"name":"International Conference on Smart Media and Applications","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132964435","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":"Multiresolution rendering by sewing trimmed NURBS surfaces","authors":"F. Kahlesz, Á. Balázs, R. Klein","doi":"10.1145/566282.566323","DOIUrl":"https://doi.org/10.1145/566282.566323","url":null,"abstract":"Most of the industrial parts are designed as trimmed NURBS. For their efficient rendering multiresolution models are needed. To create such models without artifacts at the trimming curves, one needs to sew parts together along the common boundaries. Due to the problem of determining the geometric places in 3D space along the trimming curves where sewing should be done, current approaches need to have a priori neighbourhood information of the patches and this way they do not provide an automatic solution to create large connected models just from a set of surfaces. In this paper we describe a method, which automatically determines common boundaries of trimmed NURBS surfaces and sews along them. Such a method provides us a non-manifold or manifold structure, which can be handled using standard multi-resolution techniques. Several examples of industrial data demonstrate the efficiency and applicability of our new method. The introduced techniques will also be included into the OpenSG scenegraph API [8] as the basic tool for NURBS rendering.","PeriodicalId":286112,"journal":{"name":"International Conference on Smart Media and Applications","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132018467","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":"Constraint-based motion planning for virtual prototyping","authors":"Maxim Garber, M. Lin","doi":"10.1145/566282.566320","DOIUrl":"https://doi.org/10.1145/566282.566320","url":null,"abstract":"We present a novel framework for motion planning of rigid and articulated robots in complex, dynamic, 3D environments and demonstrate its application to virtual prototyping. Our approach transforms the motion planning problem into the simulation of a dynamical system in which the motion of each rigid robot is subject to the influence of virtual forces induced by geometric constraints. These constraints may enforce joint connectivity and angle limits for articulated robots, spatial relationships between multiple collab-orative robots, or have a robot follow an estimated path to perform certain tasks in a sequence. Our algorithm works well in dynamic environments with moving obstacles and is applicable to challenging planning scenarios where multiple robots must move simultaneously to achieve a collision free path. We demonstrate its effectiveness for parts removal, automated car painting, and assembly line planning scenarios.","PeriodicalId":286112,"journal":{"name":"International Conference on Smart Media and Applications","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122334307","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":"Constraint-based design of optimal transport elements","authors":"Michael Drumheller","doi":"10.1145/566282.566338","DOIUrl":"https://doi.org/10.1145/566282.566338","url":null,"abstract":"An airliner contains thousands of transport elements, such as tubes, hoses, and wires. Transport elements must be designed subject to many constraints. Some are extrinsic, involving factors such as clearance, slope, and stay-out/stayin zones. Others are intrinsic, involving factors such as bend angles and bend radii. A key problem is to design a feasible route that runs from A to B optimally (e.g., as short as possible). We describe an algorithm that allows \"sketching\" a route in terms of constraints. The user can rapidly explore trade-o.s between multiple optimal routes, making decisions and changes in terms of quantities directly related to engineering considerations. This e.ectively automates a tedious manual design process, potentially saving signi.cant amounts of time and money, as well as producing superior designs.","PeriodicalId":286112,"journal":{"name":"International Conference on Smart Media and Applications","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124305098","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}
Rafael Bidarra, Niels Kranendonk, Alex Noort, W. Bronsvoort
{"title":"A collaborative framework for integrated part and assembly modeling","authors":"Rafael Bidarra, Niels Kranendonk, Alex Noort, W. Bronsvoort","doi":"10.1145/566282.566337","DOIUrl":"https://doi.org/10.1145/566282.566337","url":null,"abstract":"An ideal product modeling system should support both part modeling and assembly modeling, instead of just either of them as is the case in most current CAD systems. A good basis for such integration is multiple-view feature modeling, as it allows focusing on different aspects of the product, while at the same time maintaining the consistency among all model views. This paper presents a framework that supports synchronous collaborative sessions via the Internet, among members of a distributed development team, with such a modeling system. The framework provides facilities for creating a hierarchical product structure, with single and compound components, and meanwhile assigning tasks to team members. The actual design of a single component is supported by a web-client specialized in part design, whereas the specification of assembly relations among components is supported by a web-client specialized in assembly design. All clients make use of the same server, which runs a multiple-view feature modeling kernel and maintains the complete product model, guaranteeing the consistency between the part design and the assembly design views. In addition, the server keeps all clients up to date and manages all communication.","PeriodicalId":286112,"journal":{"name":"International Conference on Smart Media and Applications","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130650448","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":"CSG-BRep duality and compression","authors":"J. Rossignac","doi":"10.1145/566282.566283","DOIUrl":"https://doi.org/10.1145/566282.566283","url":null,"abstract":"Solid Modeling technology has been traditionally divided into two camps: CSG and BRep. Constructive Solid Geometry (CSG) represents a shape as a Boolean combination of half-spaces. A Boundary Representations (BRep) specifies the location of the vertices their connectivity, and a description of how they should be interpolated or approximated by a piecewise simple surface (such as a polyhedon, a subdivision surface, a Bspline, or a trimmed implicit or parametric patch). We will investigate the equivalence between CSG and BRep (using a simple duality) and will show that for a large class of polyhedral models, both can be encoded using (3k+4)N bits, where N represents the number of primitives in a CSG model or equivalently the number of vertices in the dual BRep,nd where k represents the number of bits used to represent a quantization of each coordinate of vectors that define each either a vertex of the BRep or a plane of the CSG primitive. We will review recent advances in lossless and lossy compression and in selective and progressive transmission over error-prone connections. In particular, we will describe in detail the Corner Table, a simple and compact data structure for processing triangle meshes, and the Edgebreaker 3D connectivity compression algorithm, whose simplicity (2 pages of code) and effectiveness (between 1 and 1.8 bits per triangle) surpasses other compression techniques and standards. Details and source code may be found at http://www.gvu.gatech.edu/~jarek/edgebreaker/eb/.","PeriodicalId":286112,"journal":{"name":"International Conference on Smart Media and Applications","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130834976","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":"Solving spatial basic geometric constraint configurations with locus intersection","authors":"X. Gao, C. Hoffmann, Wei-Qiang Yang","doi":"10.1145/566282.566299","DOIUrl":"https://doi.org/10.1145/566282.566299","url":null,"abstract":"A basic idea of geometric constraint solving is to decompose the constraint problem into smaller ones according to some basic configurations. In this paper, we find all spatial basic configurations involving points, lines, and planes containing up to six geometric primitives in an automated way. Many of these basic configurations still resist effective analytical solutions. We propose the locus intersection method for geometric constraint solving, which is used to solve all these basic configurations.","PeriodicalId":286112,"journal":{"name":"International Conference on Smart Media and Applications","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115408832","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":"Removal of blends from boundary representation models","authors":"S. Venkataraman, M. Sohoni, Rahul Rajadhyaksha","doi":"10.1145/566282.566297","DOIUrl":"https://doi.org/10.1145/566282.566297","url":null,"abstract":"This paper reports an algorithm for deletion of blends (or fillets) from Boundary Representation (B-rep) solid models. Blend deletion is usually performed as the first step in feature recognition since it simplifies the model for recognition of volumetric features. The algorithm handles several blend types that include face-face, face-edge and vertex blends. It also handles interactions of blends with other blends and/or volumetric features. The main feature of our approach is the usage of the underlying blend structure in predicting the final topology. This results in fewer intersections and greater predictability than earlier face-deletion approaches, especially for large blend networks. Another unique feature of our algorithm is the recreation of new faces in certain situations of blend deletion.","PeriodicalId":286112,"journal":{"name":"International Conference on Smart Media and Applications","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124000792","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}