Transactions on Information and Communications Technologies vol 12, 1995 WIT Press, ISSN
|
|
- Vivien Lynch
- 5 years ago
- Views:
Transcription
1 Determining algorithms of surface visibility on a solid model and its application T.S. Huang Division of Production Engineering, Machine Design and Automation, Faculty of Engineering, Department of Mechanical Engineering, Katholieke Universiteit Leuven, Celestijnenlaan 300 B, B-3001 Heverlee, Belgium Abstract This paper discusses an algorithm, called three-dimensional convex hull, which is devised to determine the smallest convex polyhedron containing a concave polyhedron given by a solid model beforehand, as a solid model having the same data structure as that of the concave polyhedron, and describes its application to detect potential undercut problem in injection moulds design. Because of some disadvantages of the algorithm on detecting potential undercut, the author proposes a different method to generate the minimal contour solid and extensional solids from a computer solid model. Real undercuts are obtained through a Boolean difference operation on the minimal contour solid by subtracting the extensional solids and the original solid model. This method completely based on solid modelling techniques. 1. Introduction An undercut in a plastic injection mould is any restriction that prevents the moulded plastic product from being demonided from the mould. In other words, undercuts prevent either the core mould half from being extracted after the component has been formed, or the component from being ejected out of the cavity. Designers of plastic injection moulds are frequently confronted with demoulding problems resulting from undercuts and spend lots of time in detecting all possible undercuts from the engineering drawing of the components to be moulded and designing the appropriate lateral sliding mechanisms intended to release the undercut before product ejection. This has led to a strong desire for realizing an automatic undercut detection during mould design. The feature of the algorithm, called three-dimensional convex hull, is the use of the Euler operators to generate the convex hull. This hull must be represented by a solid model having the same data structure as the solid model of the given concave moulding. Then the convex hull can be used on the extraction of
2 22 Visualization and Intelligent Design in Engineering potential undercuts in mould design. One of the difficulties of the algorithm consists of the development of Euler operators for generating a convex hull. It is not so easy, however, to keep the topological information consistent within a CAD data base during the execution of set operations. The development of valid CAD models based on faces, edges, and vertices are carried out in a rigorous way, and the Euler operators must ensure the consistency of the model. In order to create real undercuts, a different manner is proposed to overcome the drawbacks of the algorithm application. This method first determines the outline curves of all visible surfaces of a moulding viewing from the withdrawal direction. It then extrudes the curves along the withdrawal direction to create an extruded solid (hereafter called "extensional solids"). The undercut could be generated by subtracting the extensional solids and the original solid moulding from the minimal contour solid which contains the given moulding. 2. WHAT IS THE THREE-DIMENSIONAL CONVEX HULL? A convex hull is the smallest convex solid containing a concave polyhedron using a solid model having the same data structure as the given part. The convex hull will be suitable for solving interference problems that will be used to generate potential undercuts. In order to make this report self-contained, an introduction to the three-dimensional convex hull algorithm is included [6,8]. A concave polyhedron is represented by using a solid model, called boundary representation (B-rep), which has the data structure shown in Fig. la [3. The boxes and lines represent data and pointers in the database, respectively. The representation of edges is done using the Winged-Edge data structure having pointers to loops (shown in Fig. Ib). For a good exposition on the winged-edge data structure, the reader is referred to reference [3]. The following sections describe the algorithm for defining a convex hull, and interpreting its application by using the moulding shown in Fig. 2 as an example. Geometry Emphasizing surface equation Emphasizing curve equation Point coordinates (a). Data structure for boundary modelling. (h). The w FIGURE 1. Data structure of an object FIGURE 2. Concave polyhedron 2-1. Define "the set of neutral vertices," and "the set of inside vertices" The "set of neutral vertices" is defined as vertices belong to edges, for which the dihedral angle is big than 180 degrees as viewed from the outside of the shape. The number of vertices shown in Fig. 2, (1,2, 3, 4, 5, 6, 7, X, 9, 10, 11, 12), are classified as "the set of neutral vertices." The other vertices of the polyhedron model, which are manifestly contained inside or in the faces of a
3 Visualization and Intelligent Design in Engineering 23 convex hull, are defined as "the set of inside vertices". For creating a three dimensional convex hull, we only need the set of neutral vertices Create afirstconvex polyhedron In order to use Euler operators to define a tetrahedron to be the first convex polyhedron with the same data structure as the concave polyhedron, four points which are not on a plane should be taken from the set of neutral vertices. This procedure is shown in Fig. 3, in which a tetrahedron can be created by using some of the Euler operators such as mvfs, mev, and mef. In Fig. 4, the first tetrahedron (convex polyhedron) of the polyhedral model is represented by a solid model by using points 1,3,7,11 from the set of neutral vertices. l.mvfs(f,,v,) 2. mev (V,,V,e,) 3. mev (V;,V,,e,) 4. mef (V,,V,,e3,fj) mvfs : make Vertex, Face, Solid 5. mev (V,,V,,eJ mev : make Edge, Vertex 6. mef (V,,V,,e,A j. * mff mr,r ;: mane makefrige,face r/u^c, rate 7. mef (V),V,,e&,fj V/ FIGURE 3. Sequence for generating tetrahedron FUJI IRK 4. The first tetrahedron (Convex polyhedron) 2-3. Remove Unfunctional Vertices With the use of the solid model the location of both the inside and neutral vertices is determined relative to the tetrahedron. All vertices lying inside or on the boundary of the tetrahedron are deleted, since they will not contribute to the generation of the new convex hull polyhedron Create a New Convex Polyhedron In order to describe the process of creating a new convex polyhedron, we use an another example shown in Fig. 5 to explan how to create it. First takes a projection of the convex polyhedron using v^ as the pointing reference. VQ, which is one of the set neutral vertices, should be outside the convex polyhedron defined so far. We shall consider the visibility of faces and edges of a convex polyhedron. Let's assume that a convex polyhedron and a specified outside viewpoint are defined in 3-D space and that surface normal are defined as outward normal vectors for all faces of the convex polyhedron. Then the visibility of faces and edges is defined as follows. (Fig. 6) W ty^&7<v "44^ rn% S f, FIGURE 5. Projection drawing,v : 'Hie outward normal vector on the pail's \ui1ace. P '. Ilie view vector trom the suit ace to the viewpom FIGURE 6. Test of face visibility
4 24 Visualization and Intelligent Design in Engineering 1. The face is visible, if the angle a is less than or equal to n/2 (N P > 0). 2. The face is invisible, if the angle a is greater n/2 (N P< 0). 3. The edge is contour line, if one of the adjacent faces is visible and the other invisible. 4. The edge is hidden, if the two faces sharing it are both invisible. 5. The edge is not a contour line but should be drawn because it is visible, when both adjacent faces are visible. So, the shape data for the convex polyhedron is classified into sets of : Fv=(f2, fv fa); visible faces, Fj={fi, fj, fj; invisible faces, Ei={e,, e?, 65,67, 6n, e^}; contour lines, 2=163, 64, e%); hidden lines, 3= {66, eg, em}; other lines (visible but not contour lines) Now a projection drawing of the convex polyhedron is constructed. Second, the shape data for the convex polyhedron projection is classified as following: Fc={f2, fj, W: FC is the set of faces having edges forming contour lines of the projection drawing. Fo={none}: FO is the set of faces that do not belong to F, among the faces drawn in the projection drawing. EC={CI, , e,,, en): E,. is the set of edges forming contour lines. Ev={e6, eg. 610): EV is the set of edges that connect to the vertices of contour lines, but do not belong to E,. Eo={none}; EO is the set of edges which do not belong to E, and E\ among the edges drawn in the projection drawing. YC={VI, Vi, Vi, Vs, Vv, v%}: Vc is the set of vertices included in contour lines. Vo={vJ: Vo is the set of vertices drawn in the projection drawing which do not belong to V^. At this stage, all of the elements of sets F<,, E^, E^, and V^ are deleted from the convex polyhedron by using Euler Operators (kef, kev) [4,5], because they are not necessary to the new convex hull polyhedron. Then a new edge line is first added to the convex polyhedron projection drawing by connecting the viewpoint VQ with any vertex belonging to set V^ using Euler Operators (mev). At the same time, the new face which is defined by the viewpoint v^ and each outline segment is added to the convex polyhedron by using Euler Operators (mef). Now a new convex hull polyhedron is constructed from the convex polyhedron and the viewpoint VQ. Table 1 summarizes the increase and decrease in the number of faces, edges, and vertices produced by the Euler operations shown in Figure 7. It may be seen that those operations respect Eulcr's law. Eulcr's Law states that in any simple polyhedron, the numbers of faces(f), edges(e), and vcrtices(v) must satisfy the equation: v-e+f=2 (1) This rule makes the following assumptions about the polyhedron: (1). All faces are simply-connected, consisting of a single ring of edges and have no holes in them.
5 Visualization and Intelligent Design in Engineering 25 (2). The solid body must be simply-connected, with no holes through it. Euler's law given by Eq. (1) are based on excludes some classes of meaningful shapes, such as shapes that contain holes. To allow for shapes, equation (1) must be modified as the following general formula: v-e+f=2(b-h)+l (2) where b, h, and 1 are the number of bodies, through holes, and faces' inner loop respectively [1,2]. For instance, the counts of the various variables of Eq. (2) for the polyhedral model shown in Fig. 2 have the following number of elements: 54 vertices, 83 edges, 29 faces, 1 body, 5 through holes, and 10 inner loo Name Existing polyhedron kef*2 kev inev mef*6 New polyhedron Operation kill edge and face kill edge and vertex make edge and vertex make edge and face (Vertices)-(edges)+(faces)= Table 1. Maintaining internal consistency within the data structure. 0 8 kev 12 _ _ )S. 9 2 mef?0 - ~l Vj > VQ FIGURE 7. Create a new convex polyhedron with v^ as a vertex Acquire Final Convex Hull Polyhedron The step 3 and step 4 are repeated until the set of neutral vertices is empty. As an ultimate result, the convex hull polyhedron is obtained as shown in Fig. X. FIGURE 8. Processing steps leading to the convex hull polyhedron.
6 26 Visualization and Intelligent Design in Engineering 3. APPLICATION OF THE THREE-DIMENSIONAL CONVEX HULL Using the moulding in Fig. 2 as an example, figure 9 shows a procedure for extracting potential undercuts. According to the withdrawal direction D, D as shown in Fig. 10a., potential undercuts No.l, No.3, No.5 and No. 6 become real undercuts: real undercuts interfere with the given part when they move out along withdrawal direction (Fig. lob). (a). Three-dimensional convex hull (h). Mould product (c). Poienlial undercuts FIGURE 9. A procedure for extracting potential-undercuts. Undercut No undercut Undercut Potential undercuts No undercut ggggl Interference between the solid model and potential undercut when the potential undercut moves out along U direction. n Interference between the solid model and potential undercut when the potential undercut moves out along D direction. Note: Real undercut only when interference for both sides. (a). Withdrawal direction (h). Real undercuts FIGURE 10. Real undercuts. Potential undercuts can be automatically extracted during mould design, by representing a convex hull polyhedron by means of a solid model. Besides, real undercuts can also be generated by checking interference between potential undercuts and the given model. 4. CREATE A CONTOUR SOLID TO OBTAIN REAL UNDERCUTS According to the proposed algorithm described above. Fig. 9a represents a convex hull polyhedron for a moulding and Fig. 9c demonstrates potential undercuts extracted by a subtraction set operation on the convex hull polyhedron and the given moulding. This proposed algorithm has a disadvantage when it determines real undercuts by designating a moulding product withdrawal direction. For example, the potential undercuts shown in Fig. 9c are actually a solid part and users must perform a split operation for cutting it on purpose [7]. An attempt was made in this example to split the potential undercut to six separately potential undercuts as shown in Fig. I Ob.
7 Visualization and Intelligent Design in Engineering 27 So, the user has to develop a split algorithm by using Euler operators to split the potential undercut. The main disabvantage of the algorithm is that it just can be used on a planer solid model. The algorithm of the creating contour solid for extracting real undercuts is shown in Fig. 11. In Fig. 11, the topological and geometrical structure of the moulding and extensional solids are always represented exactly, but the threedimension convex hull is approximated by using polyhedrons. The processing steps of this distinct method are explained in detail below, and use a mouse model as an example. input withdrawal <^sible surfaces^>* > Clip operation direction Top plane Bottom plane FIGURE 11. Hierarchy of extracting undercuts FKUIRF 12. Create a minimal conlo containing the given nu 4-1. Create the Minimal Contour Solid Containing the Moulding For creating a minimal contour solid, first access the edge information of the product from the database to obtain maxi-min z coordinate. From the mouse model created by solid primitives, we can find the A, B, C, and D surfaces are visible as look the model from top view. And then extruded these edges, which belong to visible surfaces, from minimum z position to maximum z position to create a contour solid. At the same time, two planes are defined, the top plane and the bottom plane, as shown in Fig Create Extensional Solids For creating extensional solids select contour lines, which are enclosing a visible surface. We can create an extensional solid by extruding the contour lines along the withdrawal direction until the top or bottom planes defined earlier. This step is repeated until all contour lines of visible surfaces are extruded to become extensional solids. In this example, this operation is performed five times. The A sphere surface will be extruded until its the lowest vertex to the top plane. The edges of B, C, and D face will be extruded along the D direction until the top plane and the inside sphere surface will be extruded along the D direction until
8 28 Visualization and Intelligent Design in Engineering the bottom plane. As a final result, the extensional solids are obtained as shown in Fig. 13. D AD A 5 FIGURE 13. Extensional solids Generate Real Undercuts Real undercuts can be determined by performing a difference set operation to the contour solid, extensional solids, and the given moulding. This procedure that extracts undercuts for specific shapes is shown in Figure 14. Figure 15 gives another example, in which A surface be modified to a completely visible face for creating extentional solid. Contour solid Extentional Solid Extentiona! Solids Solid Model Real Undercuts FIGURE 14. Real undercuts. Contour solid Ixtensional solid A Extensional solid B Rxtensional solid C FIGURE 15. An another example
9 Visualization and Intelligent Design in Engineering Conclusion This report discusses an algorithm for generating the smallest convex hull polyhedron represented as a solid model, having the same data structure as the given moulding. It also describes its applications to extract potential undercuts when designing moulds. The algorithm uses Euler Operations. The proposed algorithm for determining the convex hull polyhedron is composed of the following steps. The first step defines the attributes of the vertices of the given solid moulding. The second step constructs a tetrahedron by selecting four neutral vertices. The third step deletes all of the vertices that are inside or on the boundary of the tetrahedron. The fourth step creates a new polyhedron adding an unused neutral vertex, and using it as "viewpoint" from which one looks to the existing tetrahedron. The third and fourth steps are repeated until a convex polyhedron containing all the vertices defined in the first step is obtained. A new method is proposed for directly extracting real undercuts from a given solid moulding. The method is based on generating a minimal contour solid and extensional solids which are obtained by extruding boundary curves of real visible surfaces of a moulding, viewed from the withdrawal direction. Undercuts can be determined by subtracting the extensional solids and the given moulding from the minimal surrounding box. The advantage of this algorithm is it can directly use on a solid model combined with solid primitives. 6. REFERENCE [1] A. Baer, C. Eastman, M. Henrion, "Geometric modelling: a survey", Institute of Physical Planning, Carnegie-Mellon University, Pittsburgh, USA, Feb [2] H. Chiyokura, "A Method of Representing the Solid Design Process", IEEE CG&A, April 1985, pp [3] I. Zeid, CAD/CAM Theory and Practice, McGraw-Hill, [4] M. Mantyla, R. Sulonen, "GWB: A Solid Modeler with Euler Operators", IEEE CG&A, September 1982, pp [51 M. Martti, "AN INVERSION ALGORITHM FOR GEOMETRIC MODELS", Computer Graphics, Vol. 16, No. 3, July [6] S. Furukawa, "An Efficient Algorithm for Constructing Convex Hulls of 3- D Points", JSPE, Japan, Vol. 50, No. 11, [7] T. Mochizuki, N. Yuhara, "Methods of Extracting Potential Undercut and Determining Optimum Withdrawal Direction for Mold Designing". Int. J. Japan Soc. Prec. Eng., Vol. 26, No. 1 (Mar. 1992). [8] T. Mochizuki, N. Yuhara, "Determining Algorithm of Three-Dimensional Convex Hull Used for Set Operations of Solids and Its Application to Interference Problem", ISCIE, Japan, Vol. 3, No. 11, 1990.
The Principle of Duality in Data Structures and Euler Operators of Solid Modelers
The 3rd International Conference on Design Engineering and Science, ICDES 2014 Pilsen, Czech Republic, August 31 September 3, 2014 The Principle of Duality in Data Structures and Euler Operators of Solid
More informationRepresentation of Curves and Surfaces in B-Rep Solid Modelers
Representation of Curves and Surfaces in B-Rep Solid Modelers Wang Congli Escola Politécnica da USP Departamento de Engenharia Mecatrônica e de Sistemas Mecânicos Marcos de Sales Guerra Tsuzuki Escola
More informationComputer Aided Design. Solid models and B-REP
Solid models and B-REP 1 Classical modelling problem : the intersection 3 independent representations of the intersection : - a 3D NURBS curve (giving points in the global XYZ coordinate system) - a 2D
More informationGeometric Modeling Mortenson Chapter 11. Complex Model Construction
Geometric Modeling 91.580.201 Mortenson Chapter 11 Complex Model Construction Topics Topology of Models Connectivity and other intrinsic properties Graph-Based Models Emphasize topological structure Boolean
More informationSolid Modeling Lecture Series. Prof. Gary Wang Department of Mechanical and Manufacturing Engineering The University of Manitoba
Solid Modeling 25.353 Lecture Series Prof. Gary Wang Department of Mechanical and Manufacturing Engineering The University of Manitoba Information complete, unambiguous, accurate solid model Solid Modeling
More informationComputer Aided Engineering Design Prof. Anupam Saxena Department of Mechanical Engineering Indian Institute of Technology, Kanpur.
(Refer Slide Time: 00:28) Computer Aided Engineering Design Prof. Anupam Saxena Department of Mechanical Engineering Indian Institute of Technology, Kanpur Lecture - 6 Hello, this is lecture number 6 of
More informationIntroduction to Solid Modeling
Introduction to Solid Modeling Hongxin Zhang and Jieqing Feng 2007-01-15 State Key Lab of CAD&CG Zhejiang University Contents Solid Representations: An Introduction Wireframe Models Boundary Representations
More informationLecture 17: Solid Modeling.... a cubit on the one side, and a cubit on the other side Exodus 26:13
Lecture 17: Solid Modeling... a cubit on the one side, and a cubit on the other side Exodus 26:13 Who is on the LORD's side? Exodus 32:26 1. Solid Representations A solid is a 3-dimensional shape with
More informationFlavor of Computational Geometry. Convex Hull in 2D. Shireen Y. Elhabian Aly A. Farag University of Louisville
Flavor of Computational Geometry Convex Hull in 2D Shireen Y. Elhabian Aly A. Farag University of Louisville February 2010 Agenda Introduction Definitions of Convexity and Convex Hulls Naïve Algorithms
More informationChapter 12 Solid Modeling. Disadvantages of wireframe representations
Chapter 12 Solid Modeling Wireframe, surface, solid modeling Solid modeling gives a complete and unambiguous definition of an object, describing not only the shape of the boundaries but also the object
More informationL1 - Introduction. Contents. Introduction of CAD/CAM system Components of CAD/CAM systems Basic concepts of graphics programming
L1 - Introduction Contents Introduction of CAD/CAM system Components of CAD/CAM systems Basic concepts of graphics programming 1 Definitions Computer-Aided Design (CAD) The technology concerned with the
More informationWeek 7 Convex Hulls in 3D
1 Week 7 Convex Hulls in 3D 2 Polyhedra A polyhedron is the natural generalization of a 2D polygon to 3D 3 Closed Polyhedral Surface A closed polyhedral surface is a finite set of interior disjoint polygons
More informationComputer Graphics Prof. Sukhendu Das Dept. of Computer Science and Engineering Indian Institute of Technology, Madras Lecture - 24 Solid Modelling
Computer Graphics Prof. Sukhendu Das Dept. of Computer Science and Engineering Indian Institute of Technology, Madras Lecture - 24 Solid Modelling Welcome to the lectures on computer graphics. We have
More informationEULER S FORMULA AND THE FIVE COLOR THEOREM
EULER S FORMULA AND THE FIVE COLOR THEOREM MIN JAE SONG Abstract. In this paper, we will define the necessary concepts to formulate map coloring problems. Then, we will prove Euler s formula and apply
More informationSolid Bodies and Disjointed Bodies
Solid Bodies and Disjointed Bodies Generally speaking when modelling in Solid Works each Part file will contain single solid object. As you are modelling, each feature is merged or joined to the previous
More informationEngineering designs today are frequently
Basic CAD Engineering designs today are frequently constructed as mathematical solid models instead of solely as 2D drawings. A solid model is one that represents a shape as a 3D object having mass properties.
More informationSolid Modeling. Ron Goldman Department of Computer Science Rice University
Solid Modeling Ron Goldman Department of Computer Science Rice University Solids Definition 1. A model which has a well defined inside and outside. 2. For each point, we can in principle determine whether
More informationCS 372: Computational Geometry Lecture 10 Linear Programming in Fixed Dimension
CS 372: Computational Geometry Lecture 10 Linear Programming in Fixed Dimension Antoine Vigneron King Abdullah University of Science and Technology November 7, 2012 Antoine Vigneron (KAUST) CS 372 Lecture
More information1. CONVEX POLYGONS. Definition. A shape D in the plane is convex if every line drawn between two points in D is entirely inside D.
1. CONVEX POLYGONS Definition. A shape D in the plane is convex if every line drawn between two points in D is entirely inside D. Convex 6 gon Another convex 6 gon Not convex Question. Why is the third
More informationGeometric Modeling. Introduction
Geometric Modeling Introduction Geometric modeling is as important to CAD as governing equilibrium equations to classical engineering fields as mechanics and thermal fluids. intelligent decision on the
More informationmanufactured parts carry good precision, excellent surface precision and high flexibility. This Baan-Chyan, Taipei, Taiwan, 220, R.O.C.
The Approach of Complex Insert Packaging Fabrication in Stereolithography Y. Y. Chiu * and J. H. Chang ++ Department of Industrial and Commercial Design, Oriental Institute of Technology, 58, Sec. 2, Syh-Chuan
More informationVALLIAMMAI ENGINEERING COLLEGE
VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur 603 203 DEPARTMENT OF MECHANICAL ENGINEERING QUESTION BANK M.E: CAD/CAM I SEMESTER ED5151 COMPUTER APPLICATIONS IN DESIGN Regulation 2017 Academic
More informationIntroduction to Solid Modeling Parametric Modeling. Mechanical Engineering Dept.
Introduction to Solid Modeling Parametric Modeling 1 Why draw 3D Models? 3D models are easier to interpret. Simulation under real-life conditions. Less expensive than building a physical model. 3D models
More informationOffset Triangular Mesh Using the Multiple Normal Vectors of a Vertex
285 Offset Triangular Mesh Using the Multiple Normal Vectors of a Vertex Su-Jin Kim 1, Dong-Yoon Lee 2 and Min-Yang Yang 3 1 Korea Advanced Institute of Science and Technology, sujinkim@kaist.ac.kr 2 Korea
More informationLecture notes: Object modeling
Lecture notes: Object modeling One of the classic problems in computer vision is to construct a model of an object from an image of the object. An object model has the following general principles: Compact
More informationSurface Mesh Generation
Surface Mesh Generation J.-F. Remacle Université catholique de Louvain September 22, 2011 0 3D Model For the description of the mesh generation process, let us consider the CAD model of a propeller presented
More informationUndercut feature recognition for core and cavity generation
IOP Conference Series: Materials Science and Engineering PAPER OPEN ACCESS Undercut feature recognition for core and cavity generation To cite this article: Mursyidah Md Yusof and Mohd Salman Abu Mansor
More informationGeometric Algorithms in Three Dimensions Tutorial. FSP Seminar, Strobl,
Geometric Algorithms in Three Dimensions Tutorial FSP Seminar, Strobl, 22.06.2006 Why Algorithms in Three and Higher Dimensions Which algorithms (convex hulls, triangulations etc.) can be generalized to
More informationCS 2336 Discrete Mathematics
CS 2336 Discrete Mathematics Lecture 15 Graphs: Planar Graphs 1 Outline What is a Planar Graph? Euler Planar Formula Platonic Solids Five Color Theorem Kuratowski s Theorem 2 What is a Planar Graph? Definition
More informationPlanar Graphs and Surfaces. Graphs 2 1/58
Planar Graphs and Surfaces Graphs 2 1/58 Last time we discussed the Four Color Theorem, which says that any map can be colored with at most 4 colors and not have two regions that share a border having
More informationComputational Geometry
Lecture 1: Introduction and convex hulls Geometry: points, lines,... Geometric objects Geometric relations Combinatorial complexity Computational geometry Plane (two-dimensional), R 2 Space (three-dimensional),
More information1. Introduction to Constructive Solid Geometry (CSG)
opyright@010, YZU Optimal Design Laboratory. All rights reserved. Last updated: Yeh-Liang Hsu (010-1-10). Note: This is the course material for ME550 Geometric modeling and computer graphics, Yuan Ze University.
More informationME 290-R Spring 2013 McMains Homework # 1 Due Friday Feb 15 5pm (slide under my office door; I will be at an all-day faculty retreat)
ME 290-R Spring 2013 McMains Homework # 1 Due Friday Feb 15 5pm (slide under my office door; I will be at an all-day faculty retreat) 1) Obtain access to SolidWorks, for example in the CAD labs in 2105/2107
More information25. How would you make the octahedral die shown below?
304450_ch_08_enqxd 12/6/06 1:39 PM Page 577 Chapter Summary 577 draw others you will not necessarily need all of them. Describe your method, other than random trial and error. How confident are you that
More informationCurvature Berkeley Math Circle January 08, 2013
Curvature Berkeley Math Circle January 08, 2013 Linda Green linda@marinmathcircle.org Parts of this handout are taken from Geometry and the Imagination by John Conway, Peter Doyle, Jane Gilman, and Bill
More informationConvex Hulls (3D) O Rourke, Chapter 4
Convex Hulls (3D) O Rourke, Chapter 4 Outline Polyhedra Polytopes Euler Characteristic (Oriented) Mesh Representation Polyhedra Definition: A polyhedron is a solid region in 3D space whose boundary is
More informationSolid Bodies and Disjointed bodies
Solid Bodies and Disjointed bodies Generally speaking when modelling in Solid Works each Part file will contain single solid object. As you are modelling, each feature is merged or joined to the previous
More informationThe goal is the definition of points with numbers and primitives with equations or functions. The definition of points with numbers requires a
The goal is the definition of points with numbers and primitives with equations or functions. The definition of points with numbers requires a coordinate system and then the measuring of the point with
More informationLinear Programming in Small Dimensions
Linear Programming in Small Dimensions Lekcija 7 sergio.cabello@fmf.uni-lj.si FMF Univerza v Ljubljani Edited from slides by Antoine Vigneron Outline linear programming, motivation and definition one dimensional
More information1 Appendix to notes 2, on Hyperbolic geometry:
1230, notes 3 1 Appendix to notes 2, on Hyperbolic geometry: The axioms of hyperbolic geometry are axioms 1-4 of Euclid, plus an alternative to axiom 5: Axiom 5-h: Given a line l and a point p not on l,
More informationQuestion. Why is the third shape not convex?
1. CONVEX POLYGONS Definition. A shape D in the plane is convex if every line drawn between two points in D is entirely inside D. Convex 6 gon Another convex 6 gon Not convex Question. Why is the third
More informationLaboratory Manual. CAM 3 Core & Cavity Design Injection molds
Laboratory Manual CAM 3 Core & Cavity Design Injection molds Faculty of Mechanical Engineering and Robotics Department of Robotics and Mechatronics Dr. Eng. Zbigniew Śliwa Objective To create surface elements
More informationBoolean Component. Chapter 1. Boolean Operations
Chapter 1. Boolean Component Component: The Boolean Component (BOOL), in the bool directory, performs Boolean operations on the model topology of bodies, first finding the intersections between bodies,
More informationEuler's formula and Platonic solids
University of Washington Euler's formula and Platonic solids Name: David Clark, Kelsey Kyllo, Kurt Maugerle, Yue Yuan Zhang Course Number: Math 445 Professor: Julia Pevtsova Date: 2013/06/03 Table of Contents:
More informationPractical Linear Algebra: A Geometry Toolbox
Practical Linear Algebra: A Geometry Toolbox Third edition Chapter 18: Putting Lines Together: Polylines and Polygons Gerald Farin & Dianne Hansford CRC Press, Taylor & Francis Group, An A K Peters Book
More informationNOTICE WARNING CONCERNING COPYRIGHT RESTRICTIONS: The copyright law of the United States (title 17, U.S. Code) governs the making of photocopies or
NOTICE WARNING CONCERNING COPYRIGHT RESTRICTIONS: The copyright law of the United States (title 17, U.S. Code) governs the making of photocopies or other reproductions of copyrighted material. Any copying
More informationCharacter Modeling COPYRIGHTED MATERIAL
38 Character Modeling p a r t _ 1 COPYRIGHTED MATERIAL 39 Character Modeling Character Modeling 40 1Subdivision & Polygon Modeling Many of Maya's features have seen great improvements in recent updates
More informationCOMPUTING CONSTRAINED DELAUNAY
COMPUTING CONSTRAINED DELAUNAY TRIANGULATIONS IN THE PLANE By Samuel Peterson, University of Minnesota Undergraduate The Goal The Problem The Algorithms The Implementation Applications Acknowledgments
More informationSOME 024: Computer Aided Design. E. Rozos
SOME 024: Computer Aided Design E. Rozos Introduction to CAD theory part 2 Lesson structure Why Solid modelling Solid modelling methods Representation based Manufacturing based Solid modelling storage
More informationChapter 12 and 11.1 Planar graphs, regular polyhedra, and graph colorings
Chapter 12 and 11.1 Planar graphs, regular polyhedra, and graph colorings Prof. Tesler Math 184A Fall 2017 Prof. Tesler Ch. 12: Planar Graphs Math 184A / Fall 2017 1 / 45 12.1 12.2. Planar graphs Definition
More informationCS3621 Midterm Solution (Fall 2005) 150 points
CS362 Midterm Solution Fall 25. Geometric Transformation CS362 Midterm Solution (Fall 25) 5 points (a) [5 points] Find the 2D transformation matrix for the reflection about the y-axis transformation (i.e.,
More informationNON-INTEGER TOPOLOGICAL INVARIANT
NON-INTEGER TOPOLOGICAL INVARIANT FOR THIN-WALLED PRIMITIVES M. Shpitalni and H. Lipson CMSR Laboratory for Computer Graphics and CAD Faculty of Mechanical Engineering Technion, Haifa 32000, Israel Abstract
More informationCollision Detection. Jane Li Assistant Professor Mechanical Engineering & Robotics Engineering
RBE 550 MOTION PLANNING BASED ON DR. DMITRY BERENSON S RBE 550 Collision Detection Jane Li Assistant Professor Mechanical Engineering & Robotics Engineering http://users.wpi.edu/~zli11 Euler Angle RBE
More informationThe Game of Criss-Cross
Chapter 5 The Game of Criss-Cross Euler Characteristic ( ) Overview. The regions on a map and the faces of a cube both illustrate a very natural sort of situation: they are each examples of regions that
More informationINTRODUCTION TO GRAPH THEORY. 1. Definitions
INTRODUCTION TO GRAPH THEORY D. JAKOBSON 1. Definitions A graph G consists of vertices {v 1, v 2,..., v n } and edges {e 1, e 2,..., e m } connecting pairs of vertices. An edge e = (uv) is incident with
More informationStudy on Delaunay Triangulation with the Islets Constraints
Intelligent Information Management, 2010, 2, 375-379 doi:10.4236/iim.2010.26045 Published Online June 2010 (http://www.scirp.org/journal/iim) Study on Delaunay Triangulation with the Islets Constraints
More informationPRACTICAL GEOMETRY SYMMETRY AND VISUALISING SOLID SHAPES
UNIT 12 PRACTICAL GEOMETRY SYMMETRY AND VISUALISING SOLID SHAPES (A) Main Concepts and Results Let a line l and a point P not lying on it be given. By using properties of a transversal and parallel lines,
More information3D Design with 123D Design
3D Design with 123D Design Introduction: 3D Design involves thinking and creating in 3 dimensions. x, y and z axis Working with 123D Design 123D Design is a 3D design software package from Autodesk. A
More informationTwo basic types: image-precision and object-precision. Image-precision For each pixel, determine which object is visable Requires np operations
walters@buffalo.edu CSE 480/580 Lecture 21 Slide 1 Visible-Surface Determination (Hidden Surface Removal) Computationaly expensive Two basic types: image-precision and object-precision For n objects and
More informationCourse Number: Course Title: Geometry
Course Number: 1206310 Course Title: Geometry RELATED GLOSSARY TERM DEFINITIONS (89) Altitude The perpendicular distance from the top of a geometric figure to its opposite side. Angle Two rays or two line
More informationlayers in a raster model
layers in a raster model Layer 1 Layer 2 layers in an vector-based model (1) Layer 2 Layer 1 layers in an vector-based model (2) raster versus vector data model Raster model Vector model Simple data structure
More informationTERRAIN, DINOSAURS AND CADASTRES: OPTIONS FOR THREE-DIMENSIONAL MODELING
TERRAIN, DINOSAURS AND CADASTRES: OPTIONS FOR THREE-DIMENSIONAL MODELING REBECCA O.C. TSE AND CHRISTOPHER GOLD Hong Kong Polytechnic University Department of Land Surveying and Geo-Informatics Hong Kong
More informationMOLD DESIGN. Presented by: Nakul Singh, Tim Ralph, Jamie Curtis and Tim Winsor
MOLD DESIGN Presented by: Nakul Singh, Tim Ralph, Jamie Curtis and Tim Winsor Mold Design Three main components: (a) Core This duplicates the inner surface of the model. It is larger than the finished
More informationLet a line l and a point P not lying on it be given. By using properties of a transversal and parallel lines, a line which passes through the point P
Let a line l and a point P not lying on it be given. By using properties of a transversal and parallel lines, a line which passes through the point P and parallel to l, can be drawn. A triangle can be
More informationAnswer Key: Three-Dimensional Cross Sections
Geometry A Unit Answer Key: Three-Dimensional Cross Sections Name Date Objectives In this lesson, you will: visualize three-dimensional objects from different perspectives be able to create a projection
More informationReconstruction of 3D Interacting Solids of Revolution from 2D Orthographic Views
Reconstruction of 3D Interacting Solids of Revolution from 2D Orthographic Views Hanmin Lee, Soonhung Han Department of Mechanical Engeneering Korea Advanced Institute of Science & Technology 373-1, Guseong-Dong,
More information2D/3D Geometric Transformations and Scene Graphs
2D/3D Geometric Transformations and Scene Graphs Week 4 Acknowledgement: The course slides are adapted from the slides prepared by Steve Marschner of Cornell University 1 A little quick math background
More informationINTEGRATION OF TERRAIN MODELS AND BUILT-UP STRUCTURES USING CAD- TYPE EULER OPERATORS
INTEGRATION OF TERRAIN MODELS AND BUILT-UP STRUCTURES USING CAD- TYPE EULER OPERATORS Rebecca, O.C. Tse and Christopher Gold Department of Land Surveying and Geo-Informatics Hong Kong Polytechnic University,
More informationConvergent Modeling and Reverse Engineering
Convergent Modeling and Reverse Engineering 25 October 2017 Realize innovation. Tod Parrella NX Design Product Management Product Engineering Solutions tod.parrella@siemens.com Realize innovation. Siemens
More informationA Assembly Modeling Method Based on Assembly Feature Graph-Tree
A Assembly Modeling Method Based on Assembly Feature Graph-Tree FENG QI Information Inst. ZheJiang University of Finance & Economics Hangzhou, 310018 P.R.China qqfeng_fly@163.com Abstract: - Assembly model
More informationRecovering Primitives in 3D CAD meshes
Recovering Primitives in 3D CAD / R.Bénière 1/17 Recovering Primitives in 3D CAD meshes Roseline Bénière G. Subsol, G. Gesquière, F. Le Breton and W. Puech LIRMM, Montpellier, France C4W, Montpellier,
More informationComputer Aided Engineering Applications
Computer Aided Engineering Applications 1A.Geometric Modeling 1.1 Geometric modelling methods 1.2 Data representation 1.3 Modeling functions 1.4 Structure of a CAD system Engi 6928 - Fall 2014 1.Geometric
More informationSection 1-1 Points, Lines, and Planes
Section 1-1 Points, Lines, and Planes I CAN. Identify and model points, lines, and planes. Identify collinear and coplanar points and intersecting lines and planes in space. Undefined Term- Words, usually
More informationSolid Modelling. Graphics Systems / Computer Graphics and Interfaces COLLEGE OF ENGINEERING UNIVERSITY OF PORTO
Solid Modelling Graphics Systems / Computer Graphics and Interfaces 1 Solid Modelling In 2D, one set 2D line segments or curves does not necessarily form a closed area. In 3D, a collection of surfaces
More informationBands: A Physical Data Structure to Represent Both Orientable and Non-Orientable 2-Manifold Meshes
Bands: A Physical Data Structure to Represent Both Orientable and Non-Orientable 2-Manifold Meshes Abstract This paper presents a physical data structure to represent both orientable and non-orientable
More informationSpatial Data Structures
15-462 Computer Graphics I Lecture 17 Spatial Data Structures Hierarchical Bounding Volumes Regular Grids Octrees BSP Trees Constructive Solid Geometry (CSG) April 1, 2003 [Angel 9.10] Frank Pfenning Carnegie
More informationLofting 3D Shapes. Abstract
Lofting 3D Shapes Robby Prescott Department of Computer Science University of Wisconsin Eau Claire Eau Claire, Wisconsin 54701 robprescott715@gmail.com Chris Johnson Department of Computer Science University
More informationTopology and Boundary Representation. The ACIS boundary representation (B-rep) of a model is a hierarchical decomposition of the model s topology:
Chapter 6. Model Topology Topology refers to the spatial relationships between the various entities in a model. Topology describes how geometric entities are connected (connectivity). On its own, topology
More informationEngineering Drawing II
Instructional Unit Basic Shading and Rendering -Basic Shading -Students will be able -Demonstrate the ability Class Discussions 3.1.12.B, -Basic Rendering to shade a 3D model to apply shading to a 3D 3.2.12.C,
More informationSome Thoughts on Visibility
Some Thoughts on Visibility Frédo Durand MIT Lab for Computer Science Visibility is hot! 4 papers at Siggraph 4 papers at the EG rendering workshop A wonderful dedicated workshop in Corsica! A big industrial
More informationHidden Surface Removal
Outline Introduction Hidden Surface Removal Hidden Surface Removal Simone Gasparini gasparini@elet.polimi.it Back face culling Depth sort Z-buffer Introduction Graphics pipeline Introduction Modeling Geom
More informationFrom Vertices To Fragments-1
From Vertices To Fragments-1 1 Objectives Clipping Line-segment clipping polygon clipping 2 Overview At end of the geometric pipeline, vertices have been assembled into primitives Must clip out primitives
More informationExplore Solids
1212.1 Explore Solids Surface Area and Volume of Solids 12.2 Surface Area of Prisms and Cylinders 12.3 Surface Area of Pyramids and Cones 12.4 Volume of Prisms and Cylinders 12.5 Volume of Pyramids and
More informationLattice Polygon s and Pick s Theorem From Dana Paquin and Tom Davis 1 Warm-Up to Ponder
Lattice Polygon s and Pick s Theorem From Dana Paquin and Tom Davis http://www.geometer.org/mathcircles/pick.pdf 1 Warm-Up to Ponder 1. Is it possible to draw an equilateral triangle on graph paper so
More informationCSCI 4620/8626. Computer Graphics Clipping Algorithms (Chapter 8-5 )
CSCI 4620/8626 Computer Graphics Clipping Algorithms (Chapter 8-5 ) Last update: 2016-03-15 Clipping Algorithms A clipping algorithm is any procedure that eliminates those portions of a picture outside
More informationSOLID MODELLING. PARAMETRICALLY WE CAN DEFINE SOLID AS- X=x(u,v,w) Y=y(u,v,w) Z=z(u,v,w) Tricubic solid- u,v,w Є [0,1]
SOLID MODELLING PARAMETRICALLY WE CAN DEFINE SOLID AS- X=x(u,v,w) Y=y(u,v,w) Z=z(u,v,w) u w v Tricubic solid- 3 3 3 P(u,v,w) = Σ Σ Σ a ijk u i v j w k I=0 j=o k=0 u,v,w Є [0,1] GRAPH BASED MODELS OR B-Rep
More informationHigh-Dimensional Computational Geometry. Jingbo Shang University of Illinois at Urbana-Champaign Mar 5, 2018
High-Dimensional Computational Geometry Jingbo Shang University of Illinois at Urbana-Champaign Mar 5, 2018 Outline 3-D vector geometry High-D hyperplane intersections Convex hull & its extension to 3
More informationKey Concept Euler s Formula
11-1 Space Figures and Cross Sections Objectives To recognize polyhedrons and their parts To visualize cross sections of space figures Common Core State Standards G-GMD.B.4 Identify the shapes of two-dimensional
More information4.5 VISIBLE SURFACE DETECTION METHODES
4.5 VISIBLE SURFACE DETECTION METHODES A major consideration in the generation of realistic graphics displays is identifying those parts of a scene that are visible from a chosen viewing position. There
More informationParametric Modeling Design and Modeling 2011 Project Lead The Way, Inc.
Parametric Modeling Design and Modeling 2011 Project Lead The Way, Inc. 3D Modeling Steps - Sketch Step 1 Sketch Geometry Sketch Geometry Line Sketch Tool 3D Modeling Steps - Constrain Step 1 Sketch Geometry
More informationSurface and Solid Geometry. 3D Polygons
Surface and Solid Geometry D olygons Once we know our plane equation: Ax + By + Cz + D = 0, we still need to manage the truncation which leads to the polygon itself Functionally, we will need to do this
More information4. Conclusion. 5. Acknowledgment. 6. References
[10] F. P. Preparata and S. J. Hong, Convex hulls of finite sets of points in two and three dimensions, Communications of the ACM, vol. 20, pp. 87-93, 1977. [11] K. Ichida and T. Kiyono, Segmentation of
More informationMultipatched B-Spline Surfaces and Automatic Rough Cut Path Generation
Int J Adv Manuf Technol (2000) 16:100 106 2000 Springer-Verlag London Limited Multipatched B-Spline Surfaces and Automatic Rough Cut Path Generation S. H. F. Chuang and I. Z. Wang Department of Mechanical
More informationPolygon Partitioning. Lecture03
1 Polygon Partitioning Lecture03 2 History of Triangulation Algorithms 3 Outline Monotone polygon Triangulation of monotone polygon Trapezoidal decomposition Decomposition in monotone mountain Convex decomposition
More informationEuler Characteristic
Euler Characteristic Rebecca Robinson May 15, 2007 Euler Characteristic Rebecca Robinson 1 PLANAR GRAPHS 1 Planar graphs v = 5, e = 4, f = 1 v e + f = 2 v = 6, e = 7, f = 3 v = 4, e = 6, f = 4 v e + f
More informationThe radius for a regular polygon is the same as the radius of the circumscribed circle.
Perimeter and Area The perimeter and area of geometric shapes are basic properties that we need to know. The more complex a shape is, the more complex the process can be in finding its perimeter and area.
More informationThree-Dimensional Reconstruction from Projections Based On Incidence Matrices of Patterns
Available online at www.sciencedirect.com ScienceDirect AASRI Procedia 9 (2014 ) 72 77 2014 AASRI Conference on Circuit and Signal Processing (CSP 2014) Three-Dimensional Reconstruction from Projections
More information9. Visible-Surface Detection Methods
9. Visible-Surface Detection Methods More information about Modelling and Perspective Viewing: Before going to visible surface detection, we first review and discuss the followings: 1. Modelling Transformation:
More informationDevelopment of Reverse Engineering System for Machine Engineering Using 3D Bit-map Data. Tatsuro Yashiki* and Tarou Takagi*
Development of Reverse Engineering System for Machine Engineering Using 3D Bit-map Data Tatsuro Yashiki* and Tarou Takagi* *Power & Industrial Systems R&D Laboratory, Hitachi, Ltd. Abstract In this paper,
More informationExtrusion Revolve. ENGR 1182 SolidWorks 02
Extrusion Revolve ENGR 1182 SolidWorks 02 Today s Objectives Creating 3D Shapes from 2D sketches using: Extrusion Revolve SW02 In-Class Activity Extrude a Camera Revolve a Wheel SW02 Out-of-Class Homework
More information