The upper talocalcanean join
|
|
- Malcolm Briggs
- 6 years ago
- Views:
Transcription
1 The upper talocalcanean join B. Odehnal H. Stachel October 2004 Abstract The upper talocalcanean join (articulatio talocruralis) 1 is the join of the shin bone (tibia) and the ankle bone (talus). The tibia and the ankle bone are in contact at the facies articularis inferior tibiae 2 and the facies articularis superior trochleae tali 3. In order to build protheses that simulate the motion of the UTJ we study the geometry of the two surfaces FAIT and FAST, respectively. We are looking for kinematic surfaces that approximate FAIT and FASTT best. For that we use line geometric methods to fit best approximating linear line complexes and compute the axis of the thus determined helical motion. Further we registrate FAIT and FASTT in order to find configurations such that they are in contact. Measuring deviations of the registered surfaces helps to decide if FAIT and FASTT can be in line contact. The detection of possible contact curves will be a topic of future research. Keywords: shin bone, ankle bone, line geometry, linear line complex, helical motion, surface reconstruction, registration, surface normals, complex fitting. Mathematics Subject Classification (AMS 2000): 53A05, 53A17, 70B10 1 Introduction The UTJ is known as a cylindrical join (ginglymus), see [8, 14]. Unfortunately prothesis with cylindrical shape do not simulate the motion of the ankle bone 1 In the following we use the abbreviation UTJ. 2 For short: FAIT. 3 For short: FASTT. 1
2 relatively to the shin bone very well. So it is obvious to study the geometry of the surfaces FAIT and FASTT which are in contact during the motion. The shape of FAIT and FASTT, respectively, determins or at least constrains the motion of the UTJ. In Euclidean space there are exactly three types of surfaces which are invariant under Euclidean motions: cylinders, rotational surfaces and helical surfaces. Assuming that FAIT and FASTT are in contact in all points of a certain region they can only be one of these three types of surfaces. Since cylinders, rotational and helical surfaces allow a kinematic generation, i.e., they are swept by a curve under a translation, rotation or helical motion, they are called kinematic surfaces. Surfaces of that kind can easily be recognized by their set of surface normals. It is well known (see e.g. [13]) that the congruence of surface normals of a kinematic surface is contained in a linear line complex. This gives a tool for recognition of kinematic surfaces which has been of use, e.g. in [9, 12, 13]. The surfaces we have in mind - FAIT and FASTT, respectively - are represented by noisy point clouds. This 3D data is obtained by a Minolta Vivid 900 3D laser scanner. Noise can be reduced with subdivision techniques and other algorithms. Normals to the points of the triangulated surfaces are estimated locally by means of regression planes. The RANSAC principle [1] and improvements of normal estimation methods [7] are very useful. The paper is organized in the following way: In Sec. 2 we summarize basic results on line geometry and kinematics. Sec. 3 is dedicated to a detailed description of the methods and algorithms used in the exprimental part in Sec 4. The results produced by our algorithms are presented in Sec. 4. Finally we conclude and dicuss improvements and future research in Sec Fundamentals of line geometry 2.1 Coordinates of lines In this section we summarize well known facts and result from line geometry as far as needed in order to understand the methods and algorithms in the present paper. The interested reader is referred to [4, 5, 6, 13, 15]. We represent points p in Euclidean three-space R 3 by Cartesian coordinates p = (p 1, p 2, p 3 ). An oriented line L in Euclidean three-space R 3 can be 2
3 uniquely represented by normalized Plücker coordinates. Let p be a point on L and let l be a unit vector parallel to L then the vector l := x l is called momentum vector of L and the six tuple (l, l) comprises the Plücker coordinates of L. Obviously, the Plücker coordinates of lines are independent on the choice of p on L. The direction vector l and momentum vector l of a line are perpendicular and so we have l, l = 0, (1) which will be called the Plücker relation. Here and in the following x, y denotes the standard scalar product of vectors x and y, respectively. Any six tuple (l, l) of real numbers which satisfies (1) can be interpreted as the coordinates of a line in Euclidean three-space. Thus there is a one-to-one correspondence between oriented lines in Euclidean three-space and the points of a four-dimensional algebraic manifold M 4 in R 6, which is given by the equations l, l = 0, l, l = 1. (2) Assume S is a surface having only regular points, i.e., we can compute a tangent plane in each of its points or equivalently we can compute its (arbitrarily oriented) normal N = (n, n). The two-dimensional manifold of surface normals is usually called the congruence of surface normals of S. The assignment of Plücker coordinates to all the surface normals transforms the congruence of surface normals to a two-dimensional submanifold of M Linear line complex of path normals A Euclidean motion transforms points x R 3 according to x y = Ax + a, where A is an orthogonal matrix and a is a vector in R 3. Assume for a moment that A and a depend on a parameter t and assume further that all coordinate functions are at least one times differentiable. Then the velocity of a point y can be computed by v(y) = Ax + ȧ = AA T y + ȧ AA T a = c y + c. (3) Because of A s orthogonality we have AA T = E 3, where E 3 = mboxdiag(1, 1, 1). Differentiating this latter identity we find ȦAT + (ȦAT ) T = 0 which reveals the skew-symmetry of ȦA T and the product AA T y can be written as c y as done in (3). 3
4 The field of velocity vectors of a Euclidean motion thus depends linearly on the points of R 3. Assume L = (l, l) is a path normal of point y, i.e. it is normal to v(y). So we have 0= v(y), l = c y+c, l =det(c, y, l)+ c, l = c, l + c, l =:Ω(C, L). (4) Equ. (4) obviously is a linear homogeneous equation in the Plücker coordinates of the path normal L. The set of lines whose Plücker coordinates satisfy a homogeneous linear equation is called linear line complex C. The six-tupel (c, c) is a coordinate vector of C. In case of c, c 0 C is called regular linear line complex. It is well known that any regular linear line complex consists of the path normals of a certain helical motion with axis A = (a, a) = (c, c pc)/ c, where p = c, c / c, c is the so-called pitch of the helical motion. If c, c = 0 the linear line complex C is called singular. It consists of all lines intersecting a single straight line C called axis, whose normalized Plücker coordinates are a multiple of C. The discussion of the right hand side of (3) leads to the different types of Euclidean motions with time independent velocity field. The following three types can be distinguished (cf. [6, 13]): 1. c, c 0 corresponds to a helical motion. 2. c, c = 0 and c 0 describes the set of path normals of a rotation. This set of lines is known to meet the axis. 3. c = 0: In this case the path normals are arranged in parallel planes. Projectively speaking they meet a line at infinity. In this case the motion is a translation. 3 The algorithms 3.1 Complex fitting In the following we look for linear line complexes that contain given lines. In general five independent lines determine a linear line complex. Now we are given finitely many lines (in Sec. 4 we deal with approximately points and normals) of the congruence of normals of a surface S. 4
5 A closer look to Equ. (4) shows that in our setting linear line complexes are represented by hyperplanes of R 6. Since Equ. (4) is homogeneous the hyperplane defined by a linear line complex passes through the origin of the coordinate system. To fit a linear line complex C = (c, c) to a set of given lines {L i } (i = 1,..., n < ) thus means find a hyperplane H that passes through the origin of the coordinate system and minimizes the sum of squared distances of data points to it. Distances in our model of line space are measured with the metric induced by (4) since Ω(X, Y ) = 0 means X is contained in Y. Consequently the system of normal equations of the present LQ-problem is given by n T n l i l i l l T [ ] i=1 i=1 c n n = MC = 0. (5) l l T l l T c i=1 i=1 This system of homogeneous linear equations is solvable if and only if the 6 6-matrix M is singular. Thus the approximating linear line complex to L i corresponds to the eigenvector of the smallest eigenvalue of M. If M has k > 1 small eigenvalues the set of given surface normals is contained in k independet linear line complexes. For example: If the set of data comes from a sphere the normals form a bundle of line, i.e. they are concurrent in the center of the sphere. In this case M has three small eigenvalues. We can refine the computation of the linear line complex by assigning weights to the lines. Let L i be the normal at point p i of the triangulated point cloud. Let further t i be the list of triangles sharing the vertex p i. Compute the sum of the area of all triangles in t i and divide by the number of triangles in t i. We choose this kind of weight if the data is not uniformly sampled. If data is uniformly sampled, i.e. the triangles have approximately equal size we prefer another kind of weight. First we compute a linear line comlex as eigenvector to the smallest eigenvalue of M from (5). Then we can assign the momentum of a line L with respect to a linear line complex C to L. It is defined by µ(l, C) = Ω(L, C), (6) where C is normalized such that c = 1. It is elementary to verify that for a line L with normalized Plücker coordinates the identity µ(c, L) = 5
6 p cos φ d sin φ between the distribution parameter p of C, the distance d of L and the axis A of C and the angle φ enclosed by L and A holds. The momentum equals zero for lines in the complex. The momentum is approximately zero for lines that fit well into C; it becomes large for those lines that do not fit very well. A weight function like 1 w(l i ) = 1 + µ(l i, C), (7) r with positive even r punishes lines that do not fit well into C. Weights enter the computation by multiplying the Plücker coordinates of L i with w i (L i ). Finally we repeat the computation of C and weights until the sum of squared moments falls under a predefined threshold. 3.2 Reconstruction of kinematic surfaces We want to create a geometric model of a surface that is given by scattered data. So we compute the best fitting linear line complex to the set of surface normal. Now we recognize the given surface as one of the three types of kinematic surface. We do already know that kinematic surfaces admit a kinematic generation, i.e. there exists a Euclidean motion such that the given surface is swept by a curve. In order to find a curve with the required property, we apply the motion corresponding to the best approximating linear line complex C = (c, c) to the surface points. We move them until their paths hit a certain plane, e.g. a plane through the axis. The thus obtained set of points forms a fat curve m f, points are distributed in a small region around a curve if the surface admits a kinematic generation. Now a smooth curve m needs to be computed such that it is not too far from m f. There are a lot of algorithms for that, see [10, 3, 2] The thus obtained curve - we call it meridian m - can serve as generatrix. With the curve m we are able to rebuild the surface and find a simple CAD model. 3.3 Registration The registration of the CAD model and the original surface helps to check the quality of the approximation. The aim of registration processes is to 6
7 move a surface S 1 onto a surface S 2 in order to show that they are congruent or one is a good approximation of the other. Allthough there exists software for registration, we need special features. Usually registration does not care if registrated surfaces intersect. Registration algorithms only deal with geometric objects without paying attention to real world. Collison detection is not a topic for registration, though it should be. The surfaces FAIT and FASTT can touch only on specified sides: bones can not touch each other from the interior. Our registration works as follows: First we choose the sides of the surfaces where the shall come in contact. Then we look for a good starting position of the registration. Now we move S 2 against S 1 until the sum of squared distances falls under a given threshold and S 2 stays on one side of S 1. 4 Experimental part In this section we summarize the results of the algorithms applied to original data set. We briefly describe the material and results of the surface recognition and surface reconstruction algorithm. These result may help to decide which shape a talus prothesis should have. 4.1 Material We obtained data from two left and two right tali and tibiae. The point clouds we dealed with consist of approximately data points and triangles. Noise is treated with smoothing subdivision processes. We tried to extract the same area from each compound. In Fig. 1 the areas of interest are marked red. Left hand side of Fig. 1 shows a tibia. Right hand side shows an ankle bone. 4.2 Recognition and reconstruction The recognition and reconstruction phase for the tibiae leads to the results listed in Tab. 1. In Tab. 1 the pitch p, the number of points and faces of the triangular mesh of FAIT and FASTT are given. The columns w i show the distribution of surface points or equivalently surface normals with weight 7
8 Figure 1: Left: Tibia and area of interest (red). Right: Trochlea tali and area of interest (red). Figure 2: Trochlea tali: meridian curve (left), distribution of points with different weights(right) in the intervals w 1 = [1, 0.9[, w 2 = [0.9, 0.8[, w 3 = [0.8, 0.7[, w 4 = [0.7, 0.6[, w 5 = [0.6, 0.5[, w 6 = [0.5, 0]. The values in the columns are percentages. Fig. 2 shows a meridian curve of FASTT 2 on the left. Red dots of the meridian indicate points with weight larger than the mean weight. The right hand side of Fig. 2 shows the distribution of weights on FASTT 2. Points with weight in the interval w 1 are marked green, points with weights in w 2 are marked yellow, followed by red, magenta, blue and black. 8
9 FAIT p points faces w 1 w 2 w 3 w 4 w 5 w FASTT p points faces w 1 w 2 w 3 w 4 w 5 w Table 1: Tibiae and trochleae tali: pitch p, number of points and triangles, distribution of weights after final recursion step. min max mean dev. d 1 d 2 d 3 d 4 d 5 d Registration Table 2: Tibia and deviations. The results of the registration are listed in Tab. 2. The surfaces FAIT i are moved towards FASTT i. At the final position of the registration algorithm the deviations of both surfaces are computed and displayed. We computed the distances of all points in FAIT i to the surface FASTT i. Minimum and maximum distances as well as mean and standard deviation of distances are listed in Tab. 2. The percentage rates in columns d i of Tab. 2 show the relative frequency of points on FAIT i having a distance d 1 [0, 0.9[, d 2 [0.9, 1.8[, d 3 [1.8, 2.7[, d 4 [2.7, 3.6[, d 5 [3.6, 4.5[, d 6 [4.5, [, where units are Millimeters. Fig. 3 shows the deviations of FAIT 2 to FASTT 2. Nearby points are black, followed by blue, magenta, red, yellow, green and empty circles. 9
10 Figure 3: Deviations of FAIT 2 and FASTT 2. 5 Conclusion and future research The recognition and reconstruction of FASTT and FAIT do not enable general statements on the shape of these two surfaces. As can be seen from the tables the pitch of the helical motion that generates either of the surfaces is sometimes positive, sometimes negative and sometimes close to zero. Consequently more material needs to be studied. The registration shows that FAIT and FASTT can be brought in contact such that the surfaces agree at least locally in a dense set of points. Taking into account that bones are deformable under pressure, we can say that there could be a two-paramteric motion constrained by FAIT and FASTT. This conjecture can only be verified with much more data. The investigations presented so far did not deal with the case of line contact of FAIT and FASTT. Future research will attack this problem. We have to look for a method to find possible contact curves in either surfaces. If there exists a pair of congruent curves in FAIT and FASTT, respectively, we have to register FAIT and FASTT such that they agree along the contact curve, This results in a starting position for a constrained motion of FAIT against FASTT with permanent line contact during the motion. 10
11 6 Acknowledgements We have to express our sincere thanks to Prof. R. Reimann and G. Windisch from the University of Graz. They confronted us with related problems. References [1] M. A. Fischler, R. C. Bolles: Random Sample Consensus: A Paradigm for Model Fitting with Applications to Image Analysis and Automated Cartography. Comm. of the ACM, 24, 1981, [2] R. L. Graham, P. Hell: On the History of the Minimum Spanning Tree Problem. Ann. History Comput. 7, 1985, [3] R. W. Hamming: Digital Filters. Prentice-Hall, [4] J. Hoschek: Liniengeometrie. Bibliographisches Institut, Zürich, [5] M. Husty, A. Karger, H. Sachs, W. Steinhilper: Kinematik und Robotik. Springer-Verlag, [6] A. Karger, J. Novaák: Space Kinematics and Lie Groups. Gordon & Breach Science Publishers, [7] N. J. Mitra, A. Nguyen, L. Guibas: Estimating Surface Normals in Noisy Point Cloud Data. Int. J. of Comp. Geom. & Applications 15:13, 2004, [8] F. H. Netter, J. T. Hansen: Atlas of Human Anatomy. Novartis Medical Education, [9] H.Pottmann, M. Hofer, B. Odehnal, J. Wallner: Line Geometry for 3D Shape Understanding and Reconstruction. In: T. Pajdla and J. Matas, eds., Computer Vision - ECCV 2004, Part I, volume 3021 of Lecture Notes in Computer Science, 2004, [10] H. Pottmann, S. Leopoldseder, M. Hofer: Approximation with active B-spline curves and surfaces. Proc. Pacific Graphics 02, IEEE Computer Society, 2002, [11] H. Pottmann, S. Leopoldseder, M. Hofer: Registration without ICP, Computer Vision and Image Understanding 95(1), 2004,
12 [12] H. Pottmann, T. Randrup: Rotational and helical surface reconstruction for reverse engeneering. Computing 60, 1998, [13] H. Pottmann, J. Wallner: Computational Line Geometry. Springer- Verlag, [14] W. Pschyrembel, O. Dornblüth, H. Hildebrandt: Klinisches Wörterbuch. 258 th edition, de Gruyter, Berlin [15] H. Stachel: Coordinates - A Survey on Higher Geometry. Computer Networks and ISDN-Systems 29, 1997, [16] G. Windisch, B. Odehnal, R. Reimann, H. Stachel: Fünf Freiheitsgrade? - In wiefern das obere Sprunggelenk von einem idealen Schanier abweicht, poster session, Würzburg
SUBDIVISION ALGORITHMS FOR MOTION DESIGN BASED ON HOMOLOGOUS POINTS
SUBDIVISION ALGORITHMS FOR MOTION DESIGN BASED ON HOMOLOGOUS POINTS M. Hofer and H. Pottmann Institute of Geometry Vienna University of Technology, Vienna, Austria hofer@geometrie.tuwien.ac.at, pottmann@geometrie.tuwien.ac.at
More informationSIMULTANEOUS REGISTRATION OF MULTIPLE VIEWS OF A 3D OBJECT Helmut Pottmann a, Stefan Leopoldseder a, Michael Hofer a
SIMULTANEOUS REGISTRATION OF MULTIPLE VIEWS OF A 3D OBJECT Helmut Pottmann a, Stefan Leopoldseder a, Michael Hofer a a Institute of Geometry, Vienna University of Technology, Wiedner Hauptstr. 8 10, A
More informationA second order algorithm for orthogonal projection onto curves and surfaces
A second order algorithm for orthogonal projection onto curves and surfaces Shi-min Hu and Johannes Wallner Dept. of Computer Science and Technology, Tsinghua University, Beijing, China shimin@tsinghua.edu.cn;
More informationDETECTION 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 informationPlanes Intersecting Cones: Static Hypertext Version
Page 1 of 12 Planes Intersecting Cones: Static Hypertext Version On this page, we develop some of the details of the plane-slicing-cone picture discussed in the introduction. The relationship between the
More informationThis blog addresses the question: how do we determine the intersection of two circles in the Cartesian plane?
Intersecting Circles This blog addresses the question: how do we determine the intersection of two circles in the Cartesian plane? This is a problem that a programmer might have to solve, for example,
More informationThemes in the Texas CCRS - Mathematics
1. Compare real numbers. a. Classify numbers as natural, whole, integers, rational, irrational, real, imaginary, &/or complex. b. Use and apply the relative magnitude of real numbers by using inequality
More informationMOTION OF A LINE SEGMENT WHOSE ENDPOINT PATHS HAVE EQUAL ARC LENGTH. Anton GFRERRER 1 1 University of Technology, Graz, Austria
MOTION OF A LINE SEGMENT WHOSE ENDPOINT PATHS HAVE EQUAL ARC LENGTH Anton GFRERRER 1 1 University of Technology, Graz, Austria Abstract. The following geometric problem originating from an engineering
More information04 - Normal Estimation, Curves
04 - Normal Estimation, Curves Acknowledgements: Olga Sorkine-Hornung Normal Estimation Implicit Surface Reconstruction Implicit function from point clouds Need consistently oriented normals < 0 0 > 0
More informationPITSCO Math Individualized Prescriptive Lessons (IPLs)
Orientation Integers 10-10 Orientation I 20-10 Speaking Math Define common math vocabulary. Explore the four basic operations and their solutions. Form equations and expressions. 20-20 Place Value Define
More informationFlank 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 informationCurriki 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 informationOrtho-Circles of Dupin Cyclides
Journal for Geometry and Graphics Volume 10 (2006), No. 1, 73 98. Ortho-Circles of Dupin Cyclides Michael Schrott, Boris Odehnal Institute of Discrete Mathematics, Vienna University of Technology Wiedner
More informationHomogeneous coordinates, lines, screws and twists
Homogeneous coordinates, lines, screws and twists In lecture 1 of module 2, a brief mention was made of homogeneous coordinates, lines in R 3, screws and twists to describe the general motion of a rigid
More informationOutcomes List for Math Multivariable Calculus (9 th edition of text) Spring
Outcomes List for Math 200-200935 Multivariable Calculus (9 th edition of text) Spring 2009-2010 The purpose of the Outcomes List is to give you a concrete summary of the material you should know, and
More informationGeometric transformations assign a point to a point, so it is a point valued function of points. Geometric transformation may destroy the equation
Geometric transformations assign a point to a point, so it is a point valued function of points. Geometric transformation may destroy the equation and the type of an object. Even simple scaling turns a
More informationYear 8 Mathematics Curriculum Map
Year 8 Mathematics Curriculum Map Topic Algebra 1 & 2 Number 1 Title (Levels of Exercise) Objectives Sequences *To generate sequences using term-to-term and position-to-term rule. (5-6) Quadratic Sequences
More informationIntegrated Mathematics I Performance Level Descriptors
Limited A student performing at the Limited Level demonstrates a minimal command of Ohio s Learning Standards for Integrated Mathematics I. A student at this level has an emerging ability to demonstrate
More informationPrentice Hall CME Project Geometry 2009
Prentice Hall CME Project Geometry 2009 Geometry C O R R E L A T E D T O from March 2009 Geometry G.1 Points, Lines, Angles and Planes G.1.1 Find the length of line segments in one- or two-dimensional
More information8 th Grade Mathematics Unpacked Content For the new Common Core standards that will be effective in all North Carolina schools in the
8 th Grade Mathematics Unpacked Content For the new Common Core standards that will be effective in all North Carolina schools in the 2012-13. This document is designed to help North Carolina educators
More informationParameterization. Michael S. Floater. November 10, 2011
Parameterization Michael S. Floater November 10, 2011 Triangular meshes are often used to represent surfaces, at least initially, one reason being that meshes are relatively easy to generate from point
More informationContent Standard 1: Numbers, Number Sense, and Computation
Content Standard 1: Numbers, Number Sense, and Computation Place Value Fractions Comparing and Ordering Counting Facts Estimating and Estimation Strategies Determine an approximate value of radical and
More informationPrentice Hall Mathematics Geometry, Foundations Series 2011
Prentice Hall Mathematics Geometry, Foundations Series 2011 Geometry C O R R E L A T E D T O from March 2009 Geometry G.1 Points, Lines, Angles and Planes G.1.1 Find the length of line segments in one-
More informationAlternative interpretation of the Plücker quadric s ambient space and its application
Alternative interpretation of the Plücker quadric s ambient space and its application Georg Nawratil Institute of Discrete Mathematics and Geometry Funded by FWF Project Grant No. P24927-N25 18th ICGG,
More informationEnvelopes Computational Theory and Applications
Envelopes Computational Theory and Applications Category: survey Abstract for points, whose tangent plane maps to a line under the projection. These points form the so-called Based on classical geometric
More informationGlossary of dictionary terms in the AP geometry units
Glossary of dictionary terms in the AP geometry units affine linear equation: an equation in which both sides are sums of terms that are either a number times y or a number times x or just a number [SlL2-D5]
More informationStereo and Epipolar geometry
Previously Image Primitives (feature points, lines, contours) Today: Stereo and Epipolar geometry How to match primitives between two (multiple) views) Goals: 3D reconstruction, recognition Jana Kosecka
More informationPrentice Hall Mathematics: Pre-Algebra 2004 Correlated to: Colorado Model Content Standards and Grade Level Expectations (Grade 8)
Colorado Model Content Standards and Grade Level Expectations (Grade 8) Standard 1: Students develop number sense and use numbers and number relationships in problemsolving situations and communicate the
More informationA GENTLE INTRODUCTION TO THE BASIC CONCEPTS OF SHAPE SPACE AND SHAPE STATISTICS
A GENTLE INTRODUCTION TO THE BASIC CONCEPTS OF SHAPE SPACE AND SHAPE STATISTICS HEMANT D. TAGARE. Introduction. Shape is a prominent visual feature in many images. Unfortunately, the mathematical theory
More informationModel-based segmentation and recognition from range data
Model-based segmentation and recognition from range data Jan Boehm Institute for Photogrammetry Universität Stuttgart Germany Keywords: range image, segmentation, object recognition, CAD ABSTRACT This
More informationModule 1 Session 1 HS. Critical Areas for Traditional Geometry Page 1 of 6
Critical Areas for Traditional Geometry Page 1 of 6 There are six critical areas (units) for Traditional Geometry: Critical Area 1: Congruence, Proof, and Constructions In previous grades, students were
More informationMethod for computing angle constrained isoptic curves for surfaces
Annales Mathematicae et Informaticae 42 (2013) pp. 65 70 http://ami.ektf.hu Method for computing angle constrained isoptic curves for surfaces Ferenc Nagy, Roland Kunkli Faculty of Informatics, University
More informationA 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 informationModel Fitting, RANSAC. Jana Kosecka
Model Fitting, RANSAC Jana Kosecka Fitting: Overview If we know which points belong to the line, how do we find the optimal line parameters? Least squares What if there are outliers? Robust fitting, RANSAC
More informationA VERTICAL LOOK AT KEY CONCEPTS AND PROCEDURES GEOMETRY
A VERTICAL LOOK AT KEY CONCEPTS AND PROCEDURES GEOMETRY Revised TEKS (2012): Building to Geometry Coordinate and Transformational Geometry A Vertical Look at Key Concepts and Procedures Derive and use
More informationParameterization of triangular meshes
Parameterization of triangular meshes Michael S. Floater November 10, 2009 Triangular meshes are often used to represent surfaces, at least initially, one reason being that meshes are relatively easy to
More informationThe basics of rigidity
The basics of rigidity Lectures I and II Session on Granular Matter Institut Henri Poincaré R. Connelly Cornell University Department of Mathematics 1 What determines rigidity? 2 What determines rigidity?
More informationLecture 14 Shape. ch. 9, sec. 1-8, of Machine Vision by Wesley E. Snyder & Hairong Qi. Spring (CMU RI) : BioE 2630 (Pitt)
Lecture 14 Shape ch. 9, sec. 1-8, 12-14 of Machine Vision by Wesley E. Snyder & Hairong Qi Spring 2018 16-725 (CMU RI) : BioE 2630 (Pitt) Dr. John Galeotti The content of these slides by John Galeotti,
More informationChapter 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 informationCorrespondence. CS 468 Geometry Processing Algorithms. Maks Ovsjanikov
Shape Matching & Correspondence CS 468 Geometry Processing Algorithms Maks Ovsjanikov Wednesday, October 27 th 2010 Overall Goal Given two shapes, find correspondences between them. Overall Goal Given
More informationMathematics 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 informationGEOMETRIC TOOLS FOR COMPUTER GRAPHICS
GEOMETRIC TOOLS FOR COMPUTER GRAPHICS PHILIP J. SCHNEIDER DAVID H. EBERLY MORGAN KAUFMANN PUBLISHERS A N I M P R I N T O F E L S E V I E R S C I E N C E A M S T E R D A M B O S T O N L O N D O N N E W
More informationCLASSIFICATION FOR ROADSIDE OBJECTS BASED ON SIMULATED LASER SCANNING
CLASSIFICATION FOR ROADSIDE OBJECTS BASED ON SIMULATED LASER SCANNING Kenta Fukano 1, and Hiroshi Masuda 2 1) Graduate student, Department of Intelligence Mechanical Engineering, The University of Electro-Communications,
More informationGeometry I Can Statements I can describe the undefined terms: point, line, and distance along a line in a plane I can describe the undefined terms:
Geometry I Can Statements I can describe the undefined terms: point, line, and distance along a line in a plane I can describe the undefined terms: point, line, and distance along a line in a plane I can
More informationExtracting Axially Symmetric Geometry From Limited 3D Range Data
Extracting Axially Symmetric Geometry From Limited 3D Range Data Andrew Willis, Xavier Orriols, Senem Velipasalar, Xavier Binefa, David B. Cooper Brown University, Providence, RI 02912 Computer Vision
More informationModel Fitting. Introduction to Computer Vision CSE 152 Lecture 11
Model Fitting CSE 152 Lecture 11 Announcements Homework 3 is due May 9, 11:59 PM Reading: Chapter 10: Grouping and Model Fitting What to do with edges? Segment linked edge chains into curve features (e.g.,
More information1 Reasoning with Shapes
1 Reasoning with Shapes Topic 1: Using a Rectangular Coordinate System Lines, Rays, Segments, and Angles Naming Lines, Rays, Segments, and Angles Working with Measures of Segments and Angles Students practice
More informationTexture 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 informationStudents are not expected to work formally with properties of dilations until high school.
Domain: Geometry (G) Cluster: Understand congruence and similarity using physical models, transparencies, or geometry software. Standard: 8.G.1. Verify experimentally the properties of rotations, reflections,
More informationPrentice Hall. Connected Mathematics 2, 7th Grade Units Mississippi Mathematics Framework 2007 Revised, Grade 7
Prentice Hall Connected Mathematics 2, 7th Grade Units 2006 C O R R E L A T E D T O Mississippi Mathematics Framework 2007 Revised, Grade 7 NUMBER AND OPERATIONS 1. Apply concepts of rational numbers and
More informationOhio Tutorials are designed specifically for the Ohio Learning Standards to prepare students for the Ohio State Tests and end-ofcourse
Tutorial Outline Ohio Tutorials are designed specifically for the Ohio Learning Standards to prepare students for the Ohio State Tests and end-ofcourse exams. Math Tutorials offer targeted instruction,
More informationGeometry and Gravitation
Chapter 15 Geometry and Gravitation 15.1 Introduction to Geometry Geometry is one of the oldest branches of mathematics, competing with number theory for historical primacy. Like all good science, its
More informationGergonne and Nagel Points for Simplices in the n-dimensional Space
Journal for Geometry and Graphics Volume 4 (2000), No. 2, 119 127. Gergonne and Nagel Points for Simplices in the n-dimensional Space Edwin Koźniewsi 1, Renata A. Górsa 2 1 Institute of Civil Engineering,
More informationDesign Intent of Geometric Models
School of Computer Science Cardiff University Design Intent of Geometric Models Frank C. Langbein GR/M78267 GR/S69085/01 NUF-NAL 00638/G Auckland University 15th September 2004; Version 1.1 Design Intent
More informationCOMP30019 Graphics and Interaction Transformation geometry and homogeneous coordinates
COMP30019 Graphics and Interaction Transformation geometry and homogeneous coordinates Department of Computer Science and Software Engineering The Lecture outline Introduction Vectors and matrices Translation
More information55:148 Digital Image Processing Chapter 11 3D Vision, Geometry
55:148 Digital Image Processing Chapter 11 3D Vision, Geometry Topics: Basics of projective geometry Points and hyperplanes in projective space Homography Estimating homography from point correspondence
More informationSupporting 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 informationMathematics 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 information9-1 GCSE Maths. GCSE Mathematics has a Foundation tier (Grades 1 5) and a Higher tier (Grades 4 9).
9-1 GCSE Maths GCSE Mathematics has a Foundation tier (Grades 1 5) and a Higher tier (Grades 4 9). In each tier, there are three exams taken at the end of Year 11. Any topic may be assessed on each of
More informationSimplified Voronoi diagrams for motion planning of quadratically-solvable Gough-Stewart platforms
Simplified Voronoi diagrams for motion planning of quadratically-solvable Gough-Stewart platforms Rubén Vaca, Joan Aranda, and Federico Thomas Abstract The obstacles in Configuration Space of quadratically-solvable
More informationCommon core standards from Grade 8 Math: General categories/domain:
Common core standards from Grade 8 Math: General categories/domain: 1. Ratio and Proportional Relationship (5 %) 2. Then Number System (5 %) 3. Expressions and Equations (25%) 4. (25 %) 5. Geometry (20
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 informationNumber/Computation. addend Any number being added. digit Any one of the ten symbols: 0, 1, 2, 3, 4, 5, 6, 7, 8, or 9
14 Number/Computation addend Any number being added algorithm A step-by-step method for computing array A picture that shows a number of items arranged in rows and columns to form a rectangle associative
More informationA Method of Automated Landmark Generation for Automated 3D PDM Construction
A Method of Automated Landmark Generation for Automated 3D PDM Construction A. D. Brett and C. J. Taylor Department of Medical Biophysics University of Manchester Manchester M13 9PT, Uk adb@sv1.smb.man.ac.uk
More informationGeodesic and curvature of piecewise flat Finsler surfaces
Geodesic and curvature of piecewise flat Finsler surfaces Ming Xu Capital Normal University (based on a joint work with S. Deng) in Southwest Jiaotong University, Emei, July 2018 Outline 1 Background Definition
More informationGeometry. Instructional Activities:
GEOMETRY Instructional Activities: Geometry Assessment: A. Direct Instruction A. Quizzes B. Cooperative Learning B. Skill Reviews C. Technology Integration C. Test Prep Questions D. Study Guides D. Chapter
More informationG.CO.2 G.CO.3 G.CO.4 G.CO.5 G.CO.6
Standard G.CO.1 G.CO.2 G.CO.3 G.CO.4 G.CO.5 G.CO.6 Jackson County Core Curriculum Collaborative (JC4) Geometry Learning Targets in Student Friendly Language I can define the following terms precisely in
More informationMultiple View Geometry in Computer Vision
Multiple View Geometry in Computer Vision Prasanna Sahoo Department of Mathematics University of Louisville 1 Projective 3D Geometry (Back to Chapter 2) Lecture 6 2 Singular Value Decomposition Given a
More informationA 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 informationFall 2016 Semester METR 3113 Atmospheric Dynamics I: Introduction to Atmospheric Kinematics and Dynamics
Fall 2016 Semester METR 3113 Atmospheric Dynamics I: Introduction to Atmospheric Kinematics and Dynamics Lecture 5 August 31 2016 Topics: Polar coordinate system Conversion of polar coordinates to 2-D
More informationMathematics Scope & Sequence Geometry
Mathematics Scope & Sequence 2016-17 Geometry Revised: June 21, 2016 First Grading Period (24 ) Readiness Standard(s) G.5A investigate patterns to make conjectures about geometric relationships, including
More informationMATHia Unit MATHia Workspace Overview TEKS
1 Tools of Geometry Lines, Rays, Segments, and Angles Distances on the Coordinate Plane Parallel and Perpendicular Lines Angle Properties Naming Lines, Rays, Segments, and Angles Working with Measures
More informationCAMI KEYS. TOPIC 1.1 Whole numbers to to to to to
TOPIC 1.1 Whole numbers GRADE 9_CAPS Curriculum 1. Numbers, operations and relationships CONTENT Properties of numbers Describing the real number system by recognizing, defining and distinguishing properties
More informationOVERCONSTRAINED MECHANISMS BASED ON TRAPEZOHEDRA
15 TH INTERNATIONAL CONFERENCE ON GEOMETRY AND GRAPHICS 2012 ISGG 1-5 AUGUST, 2012, MONTREAL, CANADA OVERCONSTRAINED MECHANISMS BASED ON TRAPEZOHEDRA Otto ROESCHEL Graz University of Technology, Austria
More informationPre AP Geometry. Mathematics Standards of Learning Curriculum Framework 2009: Pre AP Geometry
Pre AP Geometry Mathematics Standards of Learning Curriculum Framework 2009: Pre AP Geometry 1 The content of the mathematics standards is intended to support the following five goals for students: becoming
More information2003/2010 ACOS MATHEMATICS CONTENT CORRELATION GEOMETRY 2003 ACOS 2010 ACOS
CURRENT ALABAMA CONTENT PLACEMENT G.1 Determine the equation of a line parallel or perpendicular to a second line through a given point. G.2 Justify theorems related to pairs of angles, including angles
More informationTechnische Universität Wien
Technische Universität Wien TU Geometric design of motions constrained by a contacting surface pair M. Hofer, H. Pottmann, B. Ravani Technical Report No. 97 December 2002 Institut für Geometrie A-1040
More informationGeometry. (F) analyze mathematical relationships to connect and communicate mathematical ideas; and
(1) Mathematical process standards. The student uses mathematical processes to acquire and demonstrate mathematical understanding. The student is (A) apply mathematics to problems arising in everyday life,
More informationCCSSM Curriculum Analysis Project Tool 1 Interpreting Functions in Grades 9-12
Tool 1: Standards for Mathematical ent: Interpreting Functions CCSSM Curriculum Analysis Project Tool 1 Interpreting Functions in Grades 9-12 Name of Reviewer School/District Date Name of Curriculum Materials:
More informationCORRELATION TO GEORGIA QUALITY CORE CURRICULUM FOR GEOMETRY (GRADES 9-12)
CORRELATION TO GEORGIA (GRADES 9-12) SUBJECT AREA: Mathematics COURSE: 27. 06300 TEXTBOOK TITLE: PUBLISHER: Geometry: Tools for a Changing World 2001 Prentice Hall 1 Solves problems and practical applications
More informationBasic Course Information
Basic Course Information Title: A-G Geometry Transcript abbreviations: Geo A / Geo B Length of course: Full Year Subject area: Mathematics ("c") / Geometry UC honors designation? No Prerequisites: None
More informationAQA GCSE Maths - Higher Self-Assessment Checklist
AQA GCSE Maths - Higher Self-Assessment Checklist Number 1 Use place value when calculating with decimals. 1 Order positive and negative integers and decimals using the symbols =,, , and. 1 Round to
More informationMETR Robotics Tutorial 2 Week 2: Homogeneous Coordinates
METR4202 -- Robotics Tutorial 2 Week 2: Homogeneous Coordinates The objective of this tutorial is to explore homogenous transformations. The MATLAB robotics toolbox developed by Peter Corke might be a
More informationPrentice Hall Mathematics: Course Correlated to: Colorado Model Content Standards and Grade Level Expectations (Grade 8)
Colorado Model Content Standards and Grade Level Expectations (Grade 8) Standard 1: Students develop number sense and use numbers and number relationships in problemsolving situations and communicate the
More informationRatios and Proportional Relationships (RP) 6 8 Analyze proportional relationships and use them to solve real-world and mathematical problems.
Ratios and Proportional Relationships (RP) 6 8 Analyze proportional relationships and use them to solve real-world and mathematical problems. 7.1 Compute unit rates associated with ratios of fractions,
More informationGEOMETRY. Changes to the original 2010 COS is in red. If it is red and crossed out, it has been moved to another course.
The Geometry course builds on Algebra I concepts and increases students knowledge of shapes and their properties through geometry-based applications, many of which are observable in aspects of everyday
More informationScope and Sequence for the New Jersey Core Curriculum Content Standards
Scope and Sequence for the New Jersey Core Curriculum Content Standards The following chart provides an overview of where within Prentice Hall Course 3 Mathematics each of the Cumulative Progress Indicators
More informationDIOCESE OF HARRISBURG MATHEMATICS CURRICULUM GRADE 8
MATHEMATICS CURRICULUM GRADE 8 8A Numbers and Operations 1. Demonstrate an numbers, ways of representing numbers, relationships among numbers and number systems. 2. Compute accurately and fluently. a.
More informationTutorial 3. Jun Xu, Teaching Asistant csjunxu/ February 16, COMP4134 Biometrics Authentication
Tutorial 3 Jun Xu, Teaching Asistant http://www4.comp.polyu.edu.hk/ csjunxu/ COMP4134 Biometrics Authentication February 16, 2017 Table of Contents Problems Problem 1: Answer the questions Problem 2: Pattern
More information274 Curves on Surfaces, Lecture 5
274 Curves on Surfaces, Lecture 5 Dylan Thurston Notes by Qiaochu Yuan Fall 2012 5 Ideal polygons Previously we discussed three models of the hyperbolic plane: the Poincaré disk, the upper half-plane,
More informationUsing the Best of Both!
Using the Best of Both! A Guide to Using Connected Mathematics 2 with Prentice Hall Mathematics Courses 1, 2, 3 2012, and Algebra Readiness MatBro111707BestOfBothPH10&CMP2.indd 1 6/7/11 11:59 AM Using
More informationOn Geodesics of 3D Surfaces of Rotations in Euclidean and Minkowskian Spaces
International Journal of Engineering and Applied Sciences (IJEAS) ISSN: 2394-3661, Volume-3, Issue-1, January 2016 On Geodesics of 3D Surfaces of Rotations in Euclidean and Minkowskian Spaces Anis I Saad,
More informationNURBS: Non-Uniform Rational B-Splines AUI Course Denbigh Starkey
NURBS: Non-Uniform Rational B-Splines AUI Course Denbigh Starkey 1. Background 2 2. Definitions 3 3. Using NURBS to define a circle 4 4. Homogeneous coordinates & control points at infinity 9 5. Constructing
More informationPerception and Action using Multilinear Forms
Perception and Action using Multilinear Forms Anders Heyden, Gunnar Sparr, Kalle Åström Dept of Mathematics, Lund University Box 118, S-221 00 Lund, Sweden email: {heyden,gunnar,kalle}@maths.lth.se Abstract
More informationIntroduction to Geometric Algebra Lecture VI
Introduction to Geometric Algebra Lecture VI Leandro A. F. Fernandes laffernandes@inf.ufrgs.br Manuel M. Oliveira oliveira@inf.ufrgs.br Visgraf - Summer School in Computer Graphics - 2010 CG UFRGS Lecture
More informationGraphics and Interaction Transformation geometry and homogeneous coordinates
433-324 Graphics and Interaction Transformation geometry and homogeneous coordinates Department of Computer Science and Software Engineering The Lecture outline Introduction Vectors and matrices Translation
More informationModule 4. Stereographic projection: concept and application. Lecture 4. Stereographic projection: concept and application
Module 4 Stereographic projection: concept and application Lecture 4 Stereographic projection: concept and application 1 NPTEL Phase II : IIT Kharagpur : Prof. R. N. Ghosh, Dept of Metallurgical and Materials
More informationEstimating normal vectors and curvatures by centroid weights
Computer Aided Geometric Design 21 (2004) 447 458 www.elsevier.com/locate/cagd Estimating normal vectors and curvatures by centroid weights Sheng-Gwo Chen, Jyh-Yang Wu Department of Mathematics, National
More informationUnit Activity Correlations to Common Core State Standards. Geometry. Table of Contents. Geometry 1 Statistics and Probability 8
Unit Activity Correlations to Common Core State Standards Geometry Table of Contents Geometry 1 Statistics and Probability 8 Geometry Experiment with transformations in the plane 1. Know precise definitions
More informationPoint Cloud Processing
Point Cloud Processing Has anyone seen the toothpaste? Given a point cloud: how do you detect and localize objects? how do you map terrain? What is a point cloud? Point cloud: a set of points in 3-D space
More information