Reconstructing Surfaces Using Envelopes: Bridging the Gap between Theory and Practice

Size: px
Start display at page:

Download "Reconstructing Surfaces Using Envelopes: Bridging the Gap between Theory and Practice"

Transcription

1 Reconstructing Surfaces Using Envelopes: Bridging the Gap between Theory and Practice Justin Bisceglio Blue Sky Studios, and University of Connecuticut, Department of Computer Science T.J. Peters University of Connecuticut, Department of Mathematics, Department of Computer Science Kinetsu Abe University of Connecuticut Department of Mathematics Figure 1: The process of creating an envelope and resulting approximation. Abstract Reconstruction of surfaces with boundary remains a challenge. Recent theoretical advances [Abe et al. 2006] define envelopes as surfaces without boundary to approximate those with boundary. Figure 1 shows a Möbius strip on the left, denoted as M. An illustration of its envelope appears next, intuitively understood as attaching a small ball to each point of M to create a 3-manifold. The envelope of M is then the bounding surface of this 3-manifold. The images represent approximations of this process. The new theory shows that envelopes can guarantee topological preservation during reconstruction, but practical implementations are still emerging. This theory is advantageous in that it offers a terse measure of equivalence known as an ambient isotopy and expands the class of surfaces which may be reconstructed. This work complements and extends the previous presented theory, notably by showing examples that are beyond the typically assumed hypotheses, and presents progress toward development of an algorithm that robustly implements this theorem. to the distance to its medial axis. With envelopes, the distance to the medial axis is the radius of the envelope. Thus, not only must a sample density be carefully chosen but so must the radius of the envelope. Our investigation begins by examining criteria for selecting these variables. An experimental study during the summer of 2005 contributed to an understanding of the importance of sufficient sampling and proper envelope construction. Pursuant to these findings, a detailed test on the effects of varying both the envelope radius and the sample density was performed yielding new insight regarding sufficient sampling when generating envelopes. We conclude with progress towards improving a realistic trial presented in the literature. Spline surfaces, which allow envelope construction through an exact evaluation, are used in most of our experiments. This is only helpful for testing. A publication [Abe et al. 2005] demonstrates the practical difficulties of using the envelope technique on point set data including an example with the Stanford bunny. A revised version of this bunny test is shown here. Introduction Constructing envelope enclosures around point set data, in the absence of all other geometric information, means approximating normals and identifying boundaries. The most current published approach [Ohtake et al. 2005], uses error minimization to create an adaptive spherical covering. However, the authors state that this approach is not supported by any mathematical results and is only appropriate for certain types of input data. The approximation quality of a reconstructed surface depends on how well the estimated normals approximate the true normals of the sampled surface. Dey [Dey et al. 2005] presents a detailed understanding of this concept with a survey of techniques for estimating normals and the circumstances under which they are appropriate. A sufficient sampling density is a prerequisite for approximating normals. We adapt a relation for bounding the sampling criteria [Amenta et al. 2003] to be suitable for the construction of envelopes. The sampling criteria of a surface is gauged according justinb@blueskystudios.com tpeters@cse.uconn.edu abe@math.uconn.edu Figure 2: The reconstruction of a cross-shaped pipe surface.

2 Figure 3: An early experiment with a T-shaped pipe surface. The surface was modeled with three quadratic spline surfaces with coincident boundaries along the mid-section of the T-shape. Hence, the shape is easily decomposed into three components. The purpose of this experiment was to test the ability to assemble corresponding approximations that were independently reconstructed from segmented point set data using the envelope technique. Several attempts indicate that it is not a beneficial approach when naïvely performed. The top row of the image contains two perspective views of the original shape and the decomposed components with illustrative envelope points on the right. The results of a series of reconstructions are along the bottom row. From left to right, the tests were performed with arbitrarily, increasing sample densities and decreasing envelope size. While the reconstruction results improve with successively larger data sets and decreasing envelope size, the reassembled components fail to achieve an ambient isotopic relationship to the original shape. That is, the reassembled components are never water-tight along the shared boundaries of the components. Experimental Results sample rate by a factor of two was not based on any theoretical notion. The following experiments were conducted during an undergraduate summer program hosted by the Department of Mathematics at the University of Connecticut throughout the summer of This study focused on the computational topology for approximating shapes. Similar to the T-pipe experiment in Figure 3, a cross-shaped pipe was tested and demonstrates a successful water-tight reconstruction in Figure 2. In the lower portion of the image is an enlarged view of the adjoining components showing a distinct connectivity. The top of the image displays the envelope reconstruction of one of the components on the left and its associated medial axis on the right. In this experiment, the sample density did not exceed the highest sampling used in the T-pipe experiment. As the sampling rate and envelope radius were again chosen arbitrarily, the improved result lends evidence to the importance of judicious envelope construction along with sufficient surface sampling. Figure 4 details a series of reconstructions using the envelope technique on various cut cylinders. Here, we are interested in the affect the shape of a cut has along reconstructed boundary. Three different cylinders, each with an increasingly elongated boundary, are tested. The cut is created by intersecting a plane with the cylinder where the intersecting plane is rotated from the plane perpendicular to cylinder. The variation in the shape of the cut did not produce any noticeable difference with the top two cylinders. However, the lower-left cylinder shows artifacts along the boundary of the cut. Doubling the sample density improves the result in the lower-left such that the artifacts no longer exist. This is shown in the lowerright. In all tests, the envelope radius around the cylinder is constant. As with the previous experiments, the choice to increase the Figure 4: A series of reconstructions using the envelope technique on various cut cylinders. So far, all the experiments presented used heuristics in creating the envelopes with regard to sample density and envelope radius. The next experiment expands on one of the undergraduate tests in an effort to offer insight towards choosing these variables properly. Figure 5 describes several iterations of a reconstruction with varying sampling and envelope size. The upper left corner shows the test subject - a rational quadratic, trimmed, NURBS sphere. The spline surface is rendered as a shaded tessellation. As is the case with a sphere, the shape has constant curvature. The boundary regions have a slight variation in curvature. The literature identifies curvature and the medial axis as being closely related and an im-

3 Figure 5: The results of an experiment on various approximated envelopes around a punctured sphere. The highlighted medial axis approximations are displayed larger in Figure 6.

4 Figure 6: Four enlarged views from the results on the previous figure.

5 portant factor in the reconstruction process. The expectation is to observe the effects of varying envelope characteristics most notably in the areas with the highest curvature. Several different envelope enclosures were generated from the surface. The lower left quadrant lists the numeric values for these variations while the upper right quadrant displays the envelope approximations after the sample points were reconstructed using the PowerCrust software. The envelopes are arranged corresponding to their numeric values in the data table. The lower right section contains the resulting medial axis approximations to the reconstructed envelopes. Again, the ordering corresponds to their respective envelopes. The results are interesting in that the best results were not those with the highest sampling rate and smallest envelope. This seems to suggest a dependence between the two variables, and exemplifies publications which discuss the criteria for a sufficiently dense sampling in relation to the medial axis, specifically for a point x on the original surface F the distance from x to the nearest vertex on the triangulated manifold C is at most some 0.08 times the distance from x to the medial axis of F, MA(F) [Amenta et al. 2003], [Sakkalis and Peters 2003]. What remains an enigma is the cause of artifacts in some of the cases with higher sample densities. With denser sampling, the artifacts are more frequent when the envelope radius is larger and the ratio of a point s distance to its neighbors and its distance to the medial axis approaches the theoretical criteria. Although, this criteria is meant to guarantee an ambient isotopic reconstruction which does occurs in all these trials in question. Also listed in the table is the maximum distance between any two neighboring sample points. Whether these artifacts are related to a theoretical condition or circumstantial from the PowerCrust implementation is not clear and warrants further investigation. The last experiment presented revisits an earlier, practical test [Abe et al. 2005] using the Stanford bunny data which yielded unsatisfactory results. We first perform some analysis of the data set to determine a theoretically reasonable envelope model. For simplicity, we focus only on the boundary region of our sliced bunny. Creating a spline approximation of the boundary region allows the curvature to be estimated. The maximum curvature was found to be and is shown in Figure 8 indicated by the red circle. The value was then used to create a non-self-intersecting pipe surface along the spline curve [Patrikalakis and Maekawa 2002], as well as indicate an appropriate envelope radius and sampling rate. However, for this relatively simple example, the theoretical sampling rate is computationally prohibitive. Using only the original data points from the boundary and generating envelope data around the original points produced a relatively poor reconstruction. The reconstructed curve contains gaps and is extremely coarse. As the envelope data is embellished with additional envelope samples from the spline approximation the reconstruction results begins to improve. Unfortunately, augmenting the input data to achieve this modest improvement dramatically affects the computation time of the reconstructing operation. To accomplish the final reconstruction this larger data set was subdivided into many smaller sets and the reconstructions were then reassembled. An obvious issue for future research with the envelope technique is the data requirements for practical examples. Conclusions We performed several experiments and analyses to help understand the necessary criteria when using envelopes to reconstruction surfaces from point data. The experiments highlight the strengths of the envelope method as reconstruction were performed on surfaces with boundaries, segmented data sets, and non-orientable surfaces. The observations lend support to theoretical notions regarding sampling criteria and proper envelope constructions. New questions were posed concerning the presence of artifacts in some reconstructions and the need for adaptive envelope techniques or means of reducing the data requirements for computational efficiency. Figure 7: The original bunny reconstruction Acknowledgements The poster recounts some experiments and observations performed by undergraduates during the summer of 2005 with partial support from an NSF award for Research Experiences for Undergraduates. The undergraduate researches were Adam Gamzon and John Haga from the University of Connecticut and Jason Ribeiro from the University of Pennsylvania. The authors greatly value their efforts and contributions to this study. Partial funding for all authors was from NSF grants CCF , CCF and CCR Authors J. Bisceglio and T. J. Peters were also partially funded by a 2005 IBM Faculty Award. All statements in this publication are the responsibility of the authors, not of these funding sources. The authors express their appreciation for this support. References ABE, K., BISCEGLIO, J., PETERS, T. J., RUSSELL, A. C., FER- GUSON, D. R., AND SAKKALIS, T Computational topoloogy for reconstruction of surfaces with boundary: integrating experiments and theory. In IEEE International Conference on Shape Modeling and Applications, vol. 4, IEEE, AMENTA, N., PETERS, T. J., AND RUSSELL, A. C Computational topology: ambient isotopic approximation of 2- manifolds. Theoretical Computer Science 305, DEY, T. K., LI, G., AND SU, J Normal estimation for point clouds : a comparison study for a voronoi based method. In Eurographics Symposium on Point-Based Graphics, The Eurographics Association, OHTAKE, Y., BELYAEV, A., AND SEIDEL, H.-P An integrating approach to meshing scattered point data. In SPM 05: Proceedings of the 2005 ACM symposium on Solid and physical modeling, ACM Press, New York, NY, USA, ACM, PATRIKALAKIS, N. M., AND MAEKAWA, T Shape Interrogation for Computer Aided Design and Manufacturing. Springer-Verlag. SAKKALIS, T., AND PETERS, T. J Ambient isotopic approximations for surface reconstruction and interval solids. In SM 03: Proceedings of the eighth ACM symposium on Solid modeling and applications, ACM Press, New York, NY, USA, ACM,

6 Figure 8: A spline approximation of the boundary points with region of maximum curvature indicated by a red circle (top) and a the resulting envelope point cloud (bottom). The color shift in the data points indicates the ordering of the points that was defined for the spline reconstruction. The envelope was created by projecting the data points to the spline curve. Using the Frênet frame at the closest point on the curve, a set of envelope points are created around the sample point to form a circle orthogonal to the curve. The maximum curvature was used to guide both the radius and the number of samples taken from each circle. Figure 9: Several reconstructions of the boundary curve of the split bunny example. At the top is a reconstruction that was performed using the boundary envelope data from the original bunny example. The data was mirrored to create a pipe surface. The middle image was created using envelope data from the previous figure. The envelope points are centered around the original data points from the boundary of the split bunny set. The lower image is similar to the middle image except that additional envelope points have been introduced where these additional points are centered around sample points on the spline.

Preserving computational topology by subdivision of quadratic and cubic Bézier curves

Preserving computational topology by subdivision of quadratic and cubic Bézier curves Computing (2007) DOI 10.1007/s00607-006-0208-9 Printed in The Netherlands Preserving computational topology by subdivision of quadratic and cubic Bézier curves E. L. F. Moore, T. J. Peters, and J. A. Roulier,

More information

Convergence of Geometric Algorithms for Graphics & Animation

Convergence of Geometric Algorithms for Graphics & Animation Convergence of Geometric Algorithms for Graphics & Animation E Antonov, J. Bisceglio, I. Borovikov, N. Noble, T. J. Peters October 28, 2008 Abstract Many graphics and animation applications depend upon

More information

Using surface markings to enhance accuracy and stability of object perception in graphic displays

Using surface markings to enhance accuracy and stability of object perception in graphic displays Using surface markings to enhance accuracy and stability of object perception in graphic displays Roger A. Browse a,b, James C. Rodger a, and Robert A. Adderley a a Department of Computing and Information

More information

DETECTION AND ROBUST ESTIMATION OF CYLINDER FEATURES IN POINT CLOUDS INTRODUCTION

DETECTION AND ROBUST ESTIMATION OF CYLINDER FEATURES IN POINT CLOUDS INTRODUCTION DETECTION AND ROBUST ESTIMATION OF CYLINDER FEATURES IN POINT CLOUDS Yun-Ting Su James Bethel Geomatics Engineering School of Civil Engineering Purdue University 550 Stadium Mall Drive, West Lafayette,

More information

A Constrained Delaunay Triangle Mesh Method for Three-Dimensional Unstructured Boundary Point Cloud

A Constrained Delaunay Triangle Mesh Method for Three-Dimensional Unstructured Boundary Point Cloud International Journal of Computer Systems (ISSN: 2394-1065), Volume 03 Issue 02, February, 2016 Available at http://www.ijcsonline.com/ A Constrained Delaunay Triangle Mesh Method for Three-Dimensional

More information

Spectral Surface Reconstruction from Noisy Point Clouds

Spectral Surface Reconstruction from Noisy Point Clouds Spectral Surface Reconstruction from Noisy Point Clouds 1. Briefly summarize the paper s contributions. Does it address a new problem? Does it present a new approach? Does it show new types of results?

More information

Aspect-Ratio Voronoi Diagram with Applications

Aspect-Ratio Voronoi Diagram with Applications Aspect-Ratio Voronoi Diagram with Applications Tetsuo Asano School of Information Science, JAIST (Japan Advanced Institute of Science and Technology), Japan 1-1 Asahidai, Nomi, Ishikawa, 923-1292, Japan

More information

coding of various parts showing different features, the possibility of rotation or of hiding covering parts of the object's surface to gain an insight

coding of various parts showing different features, the possibility of rotation or of hiding covering parts of the object's surface to gain an insight Three-Dimensional Object Reconstruction from Layered Spatial Data Michael Dangl and Robert Sablatnig Vienna University of Technology, Institute of Computer Aided Automation, Pattern Recognition and Image

More information

Kurt Mehlhorn, MPI für Informatik. Curve and Surface Reconstruction p.1/25

Kurt Mehlhorn, MPI für Informatik. Curve and Surface Reconstruction p.1/25 Curve and Surface Reconstruction Kurt Mehlhorn MPI für Informatik Curve and Surface Reconstruction p.1/25 Curve Reconstruction: An Example probably, you see more than a set of points Curve and Surface

More information

Irregular Vertex Editing and Pattern Design on Mesh

Irregular Vertex Editing and Pattern Design on Mesh Irregular Vertex Editing and Pattern Design on Mesh ABSTRACT Yoshihiro Kobayashi Arizona State University This paper introduces an innovative computational design tool used to edit architectural geometry

More information

SHAPE SEGMENTATION FOR SHAPE DESCRIPTION

SHAPE SEGMENTATION FOR SHAPE DESCRIPTION SHAPE SEGMENTATION FOR SHAPE DESCRIPTION Olga Symonova GraphiTech Salita dei Molini 2, Villazzano (TN), Italy olga.symonova@graphitech.it Raffaele De Amicis GraphiTech Salita dei Molini 2, Villazzano (TN),

More information

Introduction to the Mathematical Concepts of CATIA V5

Introduction to the Mathematical Concepts of CATIA V5 CATIA V5 Training Foils Introduction to the Mathematical Concepts of CATIA V5 Version 5 Release 19 January 2009 EDU_CAT_EN_MTH_FI_V5R19 1 About this course Objectives of the course Upon completion of this

More information

1. Introduction. 2. Parametrization of General CCSSs. 3. One-Piece through Interpolation. 4. One-Piece through Boolean Operations

1. Introduction. 2. Parametrization of General CCSSs. 3. One-Piece through Interpolation. 4. One-Piece through Boolean Operations Subdivision Surface based One-Piece Representation Shuhua Lai Department of Computer Science, University of Kentucky Outline. Introduction. Parametrization of General CCSSs 3. One-Piece through Interpolation

More information

Normals of subdivision surfaces and their control polyhedra

Normals of subdivision surfaces and their control polyhedra Computer Aided Geometric Design 24 (27 112 116 www.elsevier.com/locate/cagd Normals of subdivision surfaces and their control polyhedra I. Ginkel a,j.peters b,,g.umlauf a a University of Kaiserslautern,

More information

Incomplete two-manifold mesh-based tool path generation

Incomplete two-manifold mesh-based tool path generation Int J Adv Manuf Technol (2006) 27: 797 803 DOI 10.1007/s00170-004-2239-8 ORIGINAL ARTICLE Dong-Yoon Lee Su-Jin Kim Hyun-Chul Kim Sung-Gun Lee Min-Yang Yang Incomplete two-manifold mesh-based tool path

More information

Approximating Polygonal Objects by Deformable Smooth Surfaces

Approximating Polygonal Objects by Deformable Smooth Surfaces Approximating Polygonal Objects by Deformable Smooth Surfaces Ho-lun Cheng and Tony Tan School of Computing, National University of Singapore hcheng,tantony@comp.nus.edu.sg Abstract. We propose a method

More information

Almost Curvature Continuous Fitting of B-Spline Surfaces

Almost Curvature Continuous Fitting of B-Spline Surfaces Journal for Geometry and Graphics Volume 2 (1998), No. 1, 33 43 Almost Curvature Continuous Fitting of B-Spline Surfaces Márta Szilvási-Nagy Department of Geometry, Mathematical Institute, Technical University

More information

Generalized Cell Decompositions of Nested Lorenz Links

Generalized Cell Decompositions of Nested Lorenz Links Generalized Cell Decompositions of Nested Lorenz Links illiam Coenen August 20, 2018 Abstract This paper focuses on generalizing the cell decompositions of various nested Lorenz links to determine types

More information

Point-based Simplification Algorithm

Point-based Simplification Algorithm Point-based Simplification Algorithm Pai-Feng Lee 1, Bin-Shyan Jong 2 Department of Information Management, Hsing Wu College 1 Dept. of Information and Computer Engineering Engineering, Chung Yuan Christian

More information

The Ball-Pivoting Algorithm for Surface Reconstruction

The Ball-Pivoting Algorithm for Surface Reconstruction The Ball-Pivoting Algorithm for Surface Reconstruction 1. Briefly summarize the paper s contributions. Does it address a new problem? Does it present a new approach? Does it show new types of results?

More information

L1 - 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 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 information

Generating Tool Paths for Free-Form Pocket Machining Using z-buffer-based Voronoi Diagrams

Generating Tool Paths for Free-Form Pocket Machining Using z-buffer-based Voronoi Diagrams Int J Adv Manuf Technol (1999) 15:182 187 1999 Springer-Verlag London Limited Generating Tool Paths for Free-Form Pocket Machining Using z-buffer-based Voronoi Diagrams Jaehun Jeong and Kwangsoo Kim Department

More information

Correctness. The Powercrust Algorithm for Surface Reconstruction. Correctness. Correctness. Delaunay Triangulation. Tools - Voronoi Diagram

Correctness. The Powercrust Algorithm for Surface Reconstruction. Correctness. Correctness. Delaunay Triangulation. Tools - Voronoi Diagram Correctness The Powercrust Algorithm for Surface Reconstruction Nina Amenta Sunghee Choi Ravi Kolluri University of Texas at Austin Boundary of a solid Close to original surface Homeomorphic to original

More information

Outline. Reconstruction of 3D Meshes from Point Clouds. Motivation. Problem Statement. Applications. Challenges

Outline. Reconstruction of 3D Meshes from Point Clouds. Motivation. Problem Statement. Applications. Challenges Reconstruction of 3D Meshes from Point Clouds Ming Zhang Patrick Min cs598b, Geometric Modeling for Computer Graphics Feb. 17, 2000 Outline - problem statement - motivation - applications - challenges

More information

VoroCrust: Simultaneous Surface Reconstruction and Volume Meshing with Voronoi cells

VoroCrust: Simultaneous Surface Reconstruction and Volume Meshing with Voronoi cells VoroCrust: Simultaneous Surface Reconstruction and Volume Meshing with Voronoi cells Scott A. Mitchell (speaker), joint work with Ahmed H. Mahmoud, Ahmad A. Rushdi, Scott A. Mitchell, Ahmad Abdelkader

More information

A Survey of Light Source Detection Methods

A Survey of Light Source Detection Methods A Survey of Light Source Detection Methods Nathan Funk University of Alberta Mini-Project for CMPUT 603 November 30, 2003 Abstract This paper provides an overview of the most prominent techniques for light

More information

Geometric Modeling in Graphics

Geometric Modeling in Graphics Geometric Modeling in Graphics Part 10: Surface reconstruction Martin Samuelčík www.sccg.sk/~samuelcik samuelcik@sccg.sk Curve, surface reconstruction Finding compact connected orientable 2-manifold surface

More information

3 Identify shapes as two-dimensional (lying in a plane, flat ) or three-dimensional ( solid ).

3 Identify shapes as two-dimensional (lying in a plane, flat ) or three-dimensional ( solid ). Geometry Kindergarten Identify and describe shapes (squares, circles, triangles, rectangles, hexagons, cubes, cones, cylinders, and spheres). 1 Describe objects in the environment using names of shapes,

More information

A Comprehensive Introduction to SolidWorks 2011

A Comprehensive Introduction to SolidWorks 2011 A Comprehensive Introduction to SolidWorks 2011 Godfrey Onwubolu, Ph.D. SDC PUBLICATIONS www.sdcpublications.com Schroff Development Corporation Chapter 2 Geometric Construction Tools Objectives: When

More information

NESTED AND FULLY AUGMENTED LINKS

NESTED AND FULLY AUGMENTED LINKS NESTED AND FULLY AUGMENTED LINKS HAYLEY OLSON Abstract. This paper focuses on two subclasses of hyperbolic generalized fully augmented links: fully augmented links and nested links. The link complements

More information

Mathematics High School Geometry An understanding of the attributes and relationships of geometric objects can be applied in diverse contexts

Mathematics High School Geometry An understanding of the attributes and relationships of geometric objects can be applied in diverse contexts Mathematics High School Geometry An understanding of the attributes and relationships of geometric objects can be applied in diverse contexts interpreting a schematic drawing, estimating the amount of

More information

7 Fractions. Number Sense and Numeration Measurement Geometry and Spatial Sense Patterning and Algebra Data Management and Probability

7 Fractions. Number Sense and Numeration Measurement Geometry and Spatial Sense Patterning and Algebra Data Management and Probability 7 Fractions GRADE 7 FRACTIONS continue to develop proficiency by using fractions in mental strategies and in selecting and justifying use; develop proficiency in adding and subtracting simple fractions;

More information

LATEST TRENDS on APPLIED MATHEMATICS, SIMULATION, MODELLING

LATEST TRENDS on APPLIED MATHEMATICS, SIMULATION, MODELLING 3D surface reconstruction of objects by using stereoscopic viewing Baki Koyuncu, Kurtuluş Küllü bkoyuncu@ankara.edu.tr kkullu@eng.ankara.edu.tr Computer Engineering Department, Ankara University, Ankara,

More information

Advanced geometry tools for CEM

Advanced geometry tools for CEM Advanced geometry tools for CEM Introduction Modern aircraft designs are extremely complex CAD models. For example, a BAE Systems aircraft assembly consists of over 30,000 individual components. Since

More information

Supporting planning for shape, space and measures in Key Stage 4: objectives and key indicators

Supporting planning for shape, space and measures in Key Stage 4: objectives and key indicators 1 of 7 Supporting planning for shape, space and measures in Key Stage 4: objectives and key indicators This document provides objectives to support planning for shape, space and measures in Key Stage 4.

More information

Offset Triangular Mesh Using the Multiple Normal Vectors of a Vertex

Offset 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 information

Multipatched B-Spline Surfaces and Automatic Rough Cut Path Generation

Multipatched 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 information

Mathematics Curriculum

Mathematics Curriculum 6 G R A D E Mathematics Curriculum GRADE 6 5 Table of Contents 1... 1 Topic A: Area of Triangles, Quadrilaterals, and Polygons (6.G.A.1)... 11 Lesson 1: The Area of Parallelograms Through Rectangle Facts...

More information

Multi-Scale Free-Form Surface Description

Multi-Scale Free-Form Surface Description Multi-Scale Free-Form Surface Description Farzin Mokhtarian, Nasser Khalili and Peter Yuen Centre for Vision Speech and Signal Processing Dept. of Electronic and Electrical Engineering University of Surrey,

More information

LASER ADDITIVE MANUFACTURING PROCESS PLANNING AND AUTOMATION

LASER ADDITIVE MANUFACTURING PROCESS PLANNING AND AUTOMATION LASER ADDITIVE MANUFACTURING PROCESS PLANNING AND AUTOMATION Jun Zhang, Jianzhong Ruan, Frank Liou Department of Mechanical and Aerospace Engineering and Engineering Mechanics Intelligent Systems Center

More information

Chapter 4. Clustering Core Atoms by Location

Chapter 4. Clustering Core Atoms by Location Chapter 4. Clustering Core Atoms by Location In this chapter, a process for sampling core atoms in space is developed, so that the analytic techniques in section 3C can be applied to local collections

More information

Collars and Intestines: Practical Conforming Delaunay Refinement

Collars and Intestines: Practical Conforming Delaunay Refinement Collars and Intestines: Practical Conforming Delaunay Refinement Alexander Rand and Noel Walkington Carnegie Mellon University Summary. While several existing Delaunay refinement algorithms allow acute

More information

6 Mathematics Curriculum

6 Mathematics Curriculum New York State Common Core 6 Mathematics Curriculum GRADE GRADE 6 MODULE 5 Table of Contents 1 Area, Surface Area, and Volume Problems... 3 Topic A: Area of Triangles, Quadrilaterals, and Polygons (6.G.A.1)...

More information

G 6i try. On the Number of Minimal 1-Steiner Trees* Discrete Comput Geom 12:29-34 (1994)

G 6i try. On the Number of Minimal 1-Steiner Trees* Discrete Comput Geom 12:29-34 (1994) Discrete Comput Geom 12:29-34 (1994) G 6i try 9 1994 Springer-Verlag New York Inc. On the Number of Minimal 1-Steiner Trees* B. Aronov, 1 M. Bern, 2 and D. Eppstein 3 Computer Science Department, Polytechnic

More information

A Flavor of Topology. Shireen Elhabian and Aly A. Farag University of Louisville January 2010

A Flavor of Topology. Shireen Elhabian and Aly A. Farag University of Louisville January 2010 A Flavor of Topology Shireen Elhabian and Aly A. Farag University of Louisville January 2010 In 1670 s I believe that we need another analysis properly geometric or linear, which treats place directly

More information

Mathematics High School Geometry

Mathematics High School Geometry Mathematics High School Geometry An understanding of the attributes and relationships of geometric objects can be applied in diverse contexts interpreting a schematic drawing, estimating the amount of

More information

Pacific Journal of Mathematics

Pacific Journal of Mathematics Pacific Journal of Mathematics SIMPLIFYING TRIANGULATIONS OF S 3 Aleksandar Mijatović Volume 208 No. 2 February 2003 PACIFIC JOURNAL OF MATHEMATICS Vol. 208, No. 2, 2003 SIMPLIFYING TRIANGULATIONS OF S

More information

3. MODELING A THREE-PIPE INTERSECTION (3-D)

3. MODELING A THREE-PIPE INTERSECTION (3-D) 3. MODELING A THREE-PIPE INTERSECTION (3-D) This tutorial employs primitives that is, predefined GAMBIT modeling components and procedures. There are two types of GAMBIT primitives: Geometry Mesh Geometry

More information

Ray Casting of Trimmed NURBS Surfaces on the GPU

Ray Casting of Trimmed NURBS Surfaces on the GPU Ray Casting of Trimmed NURBS Surfaces on the GPU Hans-Friedrich Pabst Jan P. Springer André Schollmeyer Robert Lenhardt Christian Lessig Bernd Fröhlich Bauhaus University Weimar Faculty of Media Virtual

More information

Data Partitioning. Figure 1-31: Communication Topologies. Regular Partitions

Data Partitioning. Figure 1-31: Communication Topologies. Regular Partitions Data In single-program multiple-data (SPMD) parallel programs, global data is partitioned, with a portion of the data assigned to each processing node. Issues relevant to choosing a partitioning strategy

More information

Some Applications of Graph Bandwidth to Constraint Satisfaction Problems

Some Applications of Graph Bandwidth to Constraint Satisfaction Problems Some Applications of Graph Bandwidth to Constraint Satisfaction Problems Ramin Zabih Computer Science Department Stanford University Stanford, California 94305 Abstract Bandwidth is a fundamental concept

More information

round decimals to the nearest decimal place and order negative numbers in context

round decimals to the nearest decimal place and order negative numbers in context 6 Numbers and the number system understand and use proportionality use the equivalence of fractions, decimals and percentages to compare proportions use understanding of place value to multiply and divide

More information

In what follows, we will focus on Voronoi diagrams in Euclidean space. Later, we will generalize to other distance spaces.

In what follows, we will focus on Voronoi diagrams in Euclidean space. Later, we will generalize to other distance spaces. Voronoi Diagrams 4 A city builds a set of post offices, and now needs to determine which houses will be served by which office. It would be wasteful for a postman to go out of their way to make a delivery

More information

Curves and Surfaces 2

Curves and Surfaces 2 Curves and Surfaces 2 Computer Graphics Lecture 17 Taku Komura Today More about Bezier and Bsplines de Casteljau s algorithm BSpline : General form de Boor s algorithm Knot insertion NURBS Subdivision

More information

Using Isosurface Methods for Visualizing the Envelope of a Swept Trivariate Solid

Using Isosurface Methods for Visualizing the Envelope of a Swept Trivariate Solid Using Isosurface Methods for Visualizing the Envelope of a Swept Trivariate Solid Jason Conkey Kenneth I. Joy Center for Image Processing and Integrated Computing Department of Computer Science University

More information

Image representation. 1. Introduction

Image representation. 1. Introduction Image representation Introduction Representation schemes Chain codes Polygonal approximations The skeleton of a region Boundary descriptors Some simple descriptors Shape numbers Fourier descriptors Moments

More information

G 2 Interpolation for Polar Surfaces

G 2 Interpolation for Polar Surfaces 1 G 2 Interpolation for Polar Surfaces Jianzhong Wang 1, Fuhua Cheng 2,3 1 University of Kentucky, jwangf@uky.edu 2 University of Kentucky, cheng@cs.uky.edu 3 National Tsinhua University ABSTRACT In this

More information

NOTICE 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 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 information

Estimating Geometry and Topology from Voronoi Diagrams

Estimating Geometry and Topology from Voronoi Diagrams Estimating Geometry and Topology from Voronoi Diagrams Tamal K. Dey The Ohio State University Tamal Dey OSU Chicago 07 p.1/44 Voronoi diagrams Tamal Dey OSU Chicago 07 p.2/44 Voronoi diagrams Tamal Dey

More information

Lecture 11 (Application of Integration) Areas between Curves Let and be continuous and on. Let s look at the region between and on.

Lecture 11 (Application of Integration) Areas between Curves Let and be continuous and on. Let s look at the region between and on. Lecture 11 (Application of Integration) Areas between Curves Let and be continuous and on. Let s look at the region between and on. Definition: The area of the region bounded by the curves and, and the

More information

Hexahedral Mesh Generation using the Embedded Voronoi Graph

Hexahedral Mesh Generation using the Embedded Voronoi Graph Hexahedral Mesh Generation using the Embedded Voronoi Graph Alla Sheffer, Michal Etzion, Ari Rappoport, Michel Bercovier Institute of Computer Science, The Hebrew University, Jerusalem 91904, Israel. sheffa

More information

Spring 2011 Workshop ESSENTIALS OF 3D MODELING IN RHINOCEROS February 10 th 2011 S.R. Crown Hall Lower Core Computer Lab

Spring 2011 Workshop ESSENTIALS OF 3D MODELING IN RHINOCEROS February 10 th 2011 S.R. Crown Hall Lower Core Computer Lab [1] Open Rhinoceros. PART 1 INTRODUCTION [4] Click and hold on the Boundary Lines in where they form a crossing and Drag from TOP RIGHT to BOTTOM LEFT to enable only the PERSPECTIVE VIEW. [2] When the

More information

Texture Mapping using Surface Flattening via Multi-Dimensional Scaling

Texture Mapping using Surface Flattening via Multi-Dimensional Scaling Texture Mapping using Surface Flattening via Multi-Dimensional Scaling Gil Zigelman Ron Kimmel Department of Computer Science, Technion, Haifa 32000, Israel and Nahum Kiryati Department of Electrical Engineering

More information

Feature Extraction for Illustrating 3D Stone Tools from Unorganized Point Clouds

Feature Extraction for Illustrating 3D Stone Tools from Unorganized Point Clouds Feature Extraction for Illustrating 3D Stone Tools from Unorganized Point Clouds Enkhbayar Altantsetseg 1) Yuta Muraki 2) Katsutsugu Matsuyama 2) Fumito Chiba 3) Kouichi Konno 2) 1) Graduate School of

More information

Recent 3D Printed Sculptures

Recent 3D Printed Sculptures Recent 3D Printed Sculptures Henry Segerman November 13, 2011 1 Introduction I am a mathematician and a mathematical artist, currently a research fellow in the Department of Mathematics and Statistics

More information

Characterization of the Northwest Coast Native Art Ovoid

Characterization of the Northwest Coast Native Art Ovoid Characterization of the Northwest Coast Native Art Ovoid By: Nathaniel P. Wilkerson July 10, 2010 Probably the most predominant design unit in the art work, the Ovoid takes many shapes and forms. In theory

More information

INTRODUCTION TO CAD/CAM SYSTEMS IM LECTURE HOURS PER WEEK PRESENTIAL

INTRODUCTION TO CAD/CAM SYSTEMS IM LECTURE HOURS PER WEEK PRESENTIAL COURSE CODE INTENSITY MODALITY CHARACTERISTIC PRE-REQUISITE CO-REQUISITE CREDITS ACTUALIZATION DATE INTRODUCTION TO CAD/CAM SYSTEMS IM0242 3 LECTURE HOURS PER WEEK 48 HOURS CLASSROOM ON 16 WEEKS, 96 HOURS

More information

A Sketch Interpreter System with Shading and Cross Section Lines

A Sketch Interpreter System with Shading and Cross Section Lines Journal for Geometry and Graphics Volume 9 (2005), No. 2, 177 189. A Sketch Interpreter System with Shading and Cross Section Lines Kunio Kondo 1, Haruki Shizuka 1, Weizhong Liu 1, Koichi Matsuda 2 1 Dept.

More information

EXACT FACE-OFFSETTING FOR POLYGONAL MESHES

EXACT FACE-OFFSETTING FOR POLYGONAL MESHES 5.0 GEOMIMESIS/LANDFORMING HAMBLETON + ROSS EXACT FACE-OFFSETTING FOR POLYGONAL MESHES Elissa Ross MESH Consultants Inc. Daniel Hambleton MESH Consultants Inc. ABSTRACT Planar-faced mesh surfaces such

More information

Interactive Math Glossary Terms and Definitions

Interactive Math Glossary Terms and Definitions Terms and Definitions Absolute Value the magnitude of a number, or the distance from 0 on a real number line Addend any number or quantity being added addend + addend = sum Additive Property of Area the

More information

Design by Subdivision

Design by Subdivision Bridges 2010: Mathematics, Music, Art, Architecture, Culture Design by Subdivision Michael Hansmeyer Department for CAAD - Institute for Technology in Architecture Swiss Federal Institute of Technology

More information

Curriki Geometry Glossary

Curriki Geometry Glossary Curriki Geometry Glossary The following terms are used throughout the Curriki Geometry projects and represent the core vocabulary and concepts that students should know to meet Common Core State Standards.

More information

Normals of subdivision surfaces and their control polyhedra

Normals of subdivision surfaces and their control polyhedra Normals of subdivision surfaces and their control polyhedra I. Ginkel, a, J. Peters b, and G. Umlauf a, a University of Kaiserslautern, Germany b University of Florida, Gainesville, FL, USA Abstract For

More information

Licom Systems Ltd., Training Course Notes. 3D Surface Creation

Licom Systems Ltd., Training Course Notes. 3D Surface Creation , Training Course Notes Work Volume and Work Planes...........................1 Overview..........................................1 Work Volume....................................1 Work Plane......................................1

More information

Outline of the presentation

Outline of the presentation Surface Reconstruction Petra Surynková Charles University in Prague Faculty of Mathematics and Physics petra.surynkova@mff.cuni.cz Outline of the presentation My work up to now Surfaces of Building Practice

More information

Formal Model. Figure 1: The target concept T is a subset of the concept S = [0, 1]. The search agent needs to search S for a point in T.

Formal Model. Figure 1: The target concept T is a subset of the concept S = [0, 1]. The search agent needs to search S for a point in T. Although this paper analyzes shaping with respect to its benefits on search problems, the reader should recognize that shaping is often intimately related to reinforcement learning. The objective in reinforcement

More information

Geometry Clean-up in. Numerical Simulations

Geometry Clean-up in. Numerical Simulations Geometry Clean-up in Numerical Simulations Scope of the this Presentation The guidelines are very generic in nature and has been explained with examples. However, the users may need to check their software

More information

Carnegie Learning Math Series Course 2, A Florida Standards Program

Carnegie Learning Math Series Course 2, A Florida Standards Program to the students previous understanding of equivalent ratios Introduction to. Ratios and Rates Ratios, Rates,. and Mixture Problems.3.4.5.6 Rates and Tables to Solve Problems to Solve Problems Unit Rates

More information

Divided-and-Conquer for Voronoi Diagrams Revisited. Supervisor: Ben Galehouse Presenter: Xiaoqi Cao

Divided-and-Conquer for Voronoi Diagrams Revisited. Supervisor: Ben Galehouse Presenter: Xiaoqi Cao Divided-and-Conquer for Voronoi Diagrams Revisited Supervisor: Ben Galehouse Presenter: Xiaoqi Cao Outline Introduction Generalized Voronoi Diagram Algorithm for building generalized Voronoi Diagram Applications

More information

On ɛ-unit distance graphs

On ɛ-unit distance graphs On ɛ-unit distance graphs Geoffrey Exoo Department of Mathematics and Computer Science Indiana State University Terre Haute, IN 47809 g-exoo@indstate.edu April 9, 003 Abstract We consider a variation on

More information

The Unified Segment Tree and its Application to the Rectangle Intersection Problem

The Unified Segment Tree and its Application to the Rectangle Intersection Problem CCCG 2013, Waterloo, Ontario, August 10, 2013 The Unified Segment Tree and its Application to the Rectangle Intersection Problem David P. Wagner Abstract In this paper we introduce a variation on the multidimensional

More information

Character Modeling COPYRIGHTED MATERIAL

Character 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 information

Geometric Topology & Visualizing 1-Manifolds

Geometric Topology & Visualizing 1-Manifolds Geometric Topology & Visualizing 1-Manifolds K. E. Jordan 1, L. E. Miller 2, T. J. Peters 3, and A. C. Russell 4 1 IBM Corporation, One Rogers St., Cambridge, MA 02142 kjordan@us.ibm.com 2 University of

More information

Lecture Notes (Reflection & Mirrors)

Lecture Notes (Reflection & Mirrors) Lecture Notes (Reflection & Mirrors) Intro: - plane mirrors are flat, smooth surfaces from which light is reflected by regular reflection - light rays are reflected with equal angles of incidence and reflection

More information

MET71 COMPUTER AIDED DESIGN

MET71 COMPUTER AIDED DESIGN UNIT - II BRESENHAM S ALGORITHM BRESENHAM S LINE ALGORITHM Bresenham s algorithm enables the selection of optimum raster locations to represent a straight line. In this algorithm either pixels along X

More information

Fractal Tilings Based on Dissections of Polyhexes

Fractal Tilings Based on Dissections of Polyhexes To be published in the Proceedings of Bridges 2005 Fractal Tilings Based on Dissections of Polyhexes Robert W. Fathauer Tessellations Company 3913 E. Bronco Trail Phoenix, AZ 85044, USA E-mail: tessellations@cox.net

More information

2) For any triangle edge not on the boundary, there is exactly one neighboring

2) For any triangle edge not on the boundary, there is exactly one neighboring Triangulating Trimmed NURBS Surfaces Chang Shu and Pierre Boulanger Abstract. This paper describes techniques for the piecewise linear approximation of trimmed NURBS surfaces. The problem, called surface

More information

Structured light 3D reconstruction

Structured light 3D reconstruction Structured light 3D reconstruction Reconstruction pipeline and industrial applications rodola@dsi.unive.it 11/05/2010 3D Reconstruction 3D reconstruction is the process of capturing the shape and appearance

More information

Max-Count Aggregation Estimation for Moving Points

Max-Count Aggregation Estimation for Moving Points Max-Count Aggregation Estimation for Moving Points Yi Chen Peter Revesz Dept. of Computer Science and Engineering, University of Nebraska-Lincoln, Lincoln, NE 68588, USA Abstract Many interesting problems

More information

Flank Millable Surface Design with Conical and Barrel Tools

Flank Millable Surface Design with Conical and Barrel Tools 461 Computer-Aided Design and Applications 2008 CAD Solutions, LLC http://www.cadanda.com Flank Millable Surface Design with Conical and Barrel Tools Chenggang Li 1, Sanjeev Bedi 2 and Stephen Mann 3 1

More information

Euler s Theorem. Brett Chenoweth. February 26, 2013

Euler s Theorem. Brett Chenoweth. February 26, 2013 Euler s Theorem Brett Chenoweth February 26, 2013 1 Introduction This summer I have spent six weeks of my holidays working on a research project funded by the AMSI. The title of my project was Euler s

More information

Tracking Minimum Distances between Curved Objects with Parametric Surfaces in Real Time

Tracking Minimum Distances between Curved Objects with Parametric Surfaces in Real Time Tracking Minimum Distances between Curved Objects with Parametric Surfaces in Real Time Zhihua Zou, Jing Xiao Department of Computer Science University of North Carolina Charlotte zzou28@yahoo.com, xiao@uncc.edu

More information

Decomposition of the figure-8 knot

Decomposition of the figure-8 knot CHAPTER 1 Decomposition of the figure-8 knot This book is an introduction to knots, links, and their geometry. Before we begin, we need to define carefully exactly what we mean by knots and links, and

More information

Incomplete mesh offset for NC machining

Incomplete mesh offset for NC machining Journal of Materials Processing Technology 194 (2007) 110 120 Incomplete mesh offset for NC machining Su-Jin Kim a,, Min-Yang Yang b,1 a Mechanical and Aerospace Engineering, ERI, Gyeongsang National University,

More information

CS 4620 Midterm, March 21, 2017

CS 4620 Midterm, March 21, 2017 CS 460 Midterm, March 1, 017 This 90-minute exam has 4 questions worth a total of 100 points. Use the back of the pages if you need more space. Academic Integrity is expected of all students of Cornell

More information

Twist knots and augmented links

Twist knots and augmented links CHAPTER 7 Twist knots and augmented links In this chapter, we study a class of hyperbolic knots that have some of the simplest geometry, namely twist knots. This class includes the figure-8 knot, the 5

More information

A General Simplification Algorithm

A General Simplification Algorithm A General Simplification Algorithm Boštjan Pivec, Vid Domiter Abstract In this article a new general algorithm for triangular mesh simplification is proposed. The algorithm extends Krivograd's work from

More information

Technical Report. Removing polar rendering artifacts in subdivision surfaces. Ursula H. Augsdörfer, Neil A. Dodgson, Malcolm A. Sabin.

Technical Report. Removing polar rendering artifacts in subdivision surfaces. Ursula H. Augsdörfer, Neil A. Dodgson, Malcolm A. Sabin. Technical Report UCAM-CL-TR-689 ISSN 1476-2986 Number 689 Computer Laboratory Removing polar rendering artifacts in subdivision surfaces Ursula H. Augsdörfer, Neil A. Dodgson, Malcolm A. Sabin June 2007

More information

Decomposing and Sketching 3D Objects by Curve Skeleton Processing

Decomposing and Sketching 3D Objects by Curve Skeleton Processing Decomposing and Sketching 3D Objects by Curve Skeleton Processing Luca Serino, Carlo Arcelli, and Gabriella Sanniti di Baja Institute of Cybernetics E. Caianiello, CNR, Naples, Italy {l.serino,c.arcelli,g.sannitidibaja}@cib.na.cnr.it

More information

Provably Good Moving Least Squares

Provably Good Moving Least Squares Provably Good Moving Least Squares Ravikrishna Kolluri Computer Science Division University of California at Berkeley 1 Problem Definition Given a set of samples on a closed surface build a representation

More information