Minimum Distance between curved surfaces Li Yajuan Oct.25,2006.

Slides:



Advertisements
Similar presentations
COMP 175 | COMPUTER GRAPHICS Remco Chang1/6103b – Shapes Lecture 03b: Shapes COMP 175: Computer Graphics February 3, 2015.
Advertisements

Geometry Primer Lines and rays Planes Spheres Frustums Triangles Polygon Polyhedron.
2.1. C OLLISION D ETECTION Overview. Collision detection is used within many types of application, e.g. from robotics, through engineering simulations,
Extended Gaussian Images
1 of 25 Assignment Orthographic Wireframe Elevation Orthographic Wireframe Plan Orthographic Wireframe End-Elevation Perspective View.
CS447/ Realistic Rendering -- Solids Modeling -- Introduction to 2D and 3D Computer Graphics.
Offset of curves. Alina Shaikhet (CS, Technion)
IMA Tutorial, Instantaneous Motions - Applications to Problems in Reverse Engineering and 3D Inspection H. Pottmann.
2003 by Jim X. Chen: Introduction to Modeling Jim X. Chen George Mason University.
Objects in 3D – Parametric Surfaces Computer Graphics Seminar MUM, summer 2005.
12/06/00 Dinesh Manocha, COMP258 Solid Modeling CSG (Constructive Solid Geometry) Representations: A set theoretic Boolean expression of primitive solid.
ENDS 375 Foundations of Visualization Geometric Representation 10/5/04.
An Implicit Time-Stepping Method for Multibody Systems with Intermittent Contact Nilanjan Chakraborty, Stephen Berard, Srinivas Akella, and Jeff Trinkle.
Introduction to Boolean Operations on Free-form Solids CS284, Fall 2004 Seung Wook Kim.
17 VECTOR CALCULUS.
Curves and Surfaces CS4395: Computer Graphics 1 Mohan Sridharan Based on slides created by Edward Angel.
9-4 Geometry in Three Dimensions  Simple Closed Surfaces  Regular Polyhedra  Cylinders and Cones.
Week 13 - Wednesday CS361.
Vectors and the Geometry of Space
Modeling and representation 1 – comparative review and polygon mesh models 2.1 Introduction 2.2 Polygonal representation of three-dimensional objects 2.3.
Graphics Graphics Korea University cgvr.korea.ac.kr Creating Virtual World I 김 창 헌 Department of Computer Science Korea University
The Geometry of Solids Section 10.1.
Geometry B Section 12.3 Surface Area of Pyramids and Cones.
Section 8.4 Nack/Jones1 Section 8.4 Polyhedrons & Spheres.
Week 13 - Monday.  What did we talk about last time?  Exam 2!  Before that…  Polygonal techniques ▪ Tessellation and triangulation  Triangle strips,
Curves and Surfaces Ed Angel Professor of Computer Science, Electrical and Computer Engineering, and Media Arts University of New Mexico 1 Angel: Interactive.
Parametric Surfaces and their Area Part II. Parametric Surfaces – Tangent Plane The line u = u 0 is mapped to the gridline C 2 =r(u 0,v) Consider the.
Geometric Solids 1 Spheres. 2 A sphere is formed by revolving a circle about its diameter. In space, the set of all points that are a given distance from.
Copyright © Curt Hill Visualization of 3D Worlds How are these images described?
Collision and Proximity Queries Dinesh Manocha Department of Computer Science University of North Carolina
David Breen, William Regli and Maxim Peysakhov
Syllabus for Analytic Geometry of Space It is an introductory course, which includes the subjects usually treated in rectangular coordinates. They presuppose.
An introduction to 3D Figures
Cube A cube[1] is a three-dimensional solid object bounded by six square faces, facets or sides, with three meeting at each vertex[1]three-dimensionalsquarefacetsvertex.
Chapter Area, Pythagorean Theorem, and Volume 14 Copyright © 2013, 2010, and 2007, Pearson Education, Inc.
Shapes Digital Image Synthesis Yung-Yu Chuang 10/05/2006 with slides by Pat Hanrahan.
3D Object Representations graphics scenes contain solid geometric objects trees, flowers, clouds, rocks, water representations surface ↔interior models.
Three-Dimensional Object Representation
Constructive Solid Geometry Ray Tracing CSG Models
Geometrically Bounded Wireframe AIC (Part 510) Grouping of curves relevant for 3-dimensional wireframe modeling without topological constructs Elementary.
Physically based deformations of implicit surfaces Michal Remiš.
Volume and Solid Modeling
11.6 Surfaces in Space.
RENDERING : Global Illumination
MATHEMATICS B.A./B.Sc. (GENERAL) FIRST YEAR EXAMINATIONS,2012.
3D Rendering 2016, Fall.
Unit 11: 3-Dimensional Geometry
Chapter 12 Math 181.
COMP259: Physically-Based Modeling, Simulation & Animation
3D Object Representations
2.1. Collision Detection Overview.
© University of Wisconsin, CS559 Fall 2004
University of New Mexico
University of New Mexico
Vector Functions and Space Curves
Unit 11: 3-Dimensional Geometry
Which of the equations below is an equation of a cone?
Curves and Surfaces Ed Angel
Lecture 27: Solid Modeling
Digital Image Synthesis Yung-Yu Chuang 10/4/2005
COMP259: Physically-Based Modeling, Simulation & Animation
Object Intersection CSE 681.
Chapter 12 Vectors and Geometry of Space
Geometric Solids All bounded three-dimensional geometric figures. Examples: Sphere, Cylinders, Cubes, Cones, Pyramids, and Prisms.
Which of the equations below is an equation of a cone?
Geometric Solids All bounded three-dimensional geometric figures. Examples: Sphere, Cylinders, Cubes, Cones, Pyramids, and Prisms.
11.5 Explore Solids Mrs. vazquez Geometry.
14 Chapter Area, Pythagorean Theorem, and Volume
Presentation transcript:

Minimum Distance between curved surfaces Li Yajuan Oct.25,2006

Computation of the minimum distance between two objects is very important   Collision detection   Physical simulation in computer graphics   Animation   Virtual prototyping in haptic rendering   Robot motion planning and path modification   Computer games

Computation of the minimum distance between two polyhedra   A polygonal representation is not considered a true restriction since real objects can be approximated arbitrarily precisely by a polyhedron.   The basic algorithms and predicates can be implemented robustly and very efficiently on polygons.  Time: the number of polyhedral faces approximating the given curved surfaces is usually very large

Computation of the minimum distance between two curved surfaces   Ellipsoids and degenerate quadrics, such as cylinders and cones, are important primitives for solid modeling systems.   Ellipsoids can be used for efficiently bounding more general solids.   Bischoff and Kobbelt (02) developped techniques for approximating general objects by ellipsoids.

References   [1]Kim K-J. Minimum distance between a canal surface and a simple surface. CAD, 2003;35(10):871–9.   [2]Lennerz C, Schomer E. Efficient distance computation for quadratic curves and surfaces. In: Proceeding of Geometric Modeling and Processing p. 60–9.   [3]Sohn K-A, Juttler B, Kim M-S, Wang W. Computing distances between surfaces using line geometry. In: Pacific conference on computer graphics and applications p. 236–45.   [4]Chen Xiaodiao, etc.Computing minimum distance between two implicit algebraic surfaces. CAD, 2006; –1061.

Minimum distance between a canal surface and a simple surface [1] The minimum distance between two parametric surfaces F(u,v) and G(s,t) are described by Piegl(1995):

A Canal  A canal surface is defined by the trajectory of the center C(t) and the function determining the radius r(t).

A Canal  A canal surface is defined by the trajectory of the center C(t) and the function determining the radius r(t).

A general solution  Finding roots of a function of a single parameter of a necessary condition:

Distance between a canal surface and a plane

Distance between a canal surface and a sphere

Distance between a canal surface and a cylinder

Distance between a canal surface and a cone

Distance between a canal surface and a torus

Efficient distance computation for quadratic curves and surfaces [2].

Efficient distance computation for quadratic curves and surfaces.

Computing Distances Between Surfaces Using Line Geometry [3]  Using line geometry, the distance computation is reformulated as a simple instance of a surface-surface intersection problem, which leads to lowdimensional root finding in a system of equations.

Line Coordinates(Plucker,1846)

The normal congruence of a surface:

 Parameter representation

The normal congruence of a surface:  Implicit representation

The normal congruence of a surface:  Implicit representation

The normal congruence of a surface:

Distance Computation

 Distance between two ellipsoids;  Distance between an ellipsoid and a cylinder;  Distance between an ellipsoid and a cone;  Distance between an ellipsoid and a torus.

Experimental Results

Computing minimum distance between two implicit algebraic surfaces [4].

Computing minimum distance between two implicit algebraic surfaces.

Resultant method

Computing minimum distance between two implicit algebraic surfaces. Eliminate λandμ If S 1 is an implicit surface If S 1 is a parameter surface

Computing minimum distance between two implicit algebraic surfaces.

Algorithm

Minimum distance between a quadric surface and an implicit algebraic surface.  A cylinder and an implicit algebraic surface.

Minimum distance between a quadric surface and an implicit algebraic surface.  A cone and an implicit algebraic surface.

Minimum distance between a quadric surface and an implicit algebraic surface.  An elliptic paraboloid and an implicit algebraic surface.

Minimum distance between a quadric surface and an implicit algebraic surface.  An ellipsoid and an implicit algebraic surface.

Minimum distance between a quadric surface and an implicit algebraic surface.  A torus and an implicit algebraic surface.

Minimum distance between a canal and an implicit algebraic surface.

Minimum distance between two canal surfaces.

Minimum distance between two implicit surfaces.

comparison  [1]Kim K-J. Minimum distance between a canal surface and a simple surface. CAD, 2003;35(10):871–9.  [2]Lennerz C, Schomer E. Efficient distance computation for quadratic curves and surfaces. In: Proceeding of Geometric Modeling and Processing p. 60–9.  [3]Sohn K-A, Juttler B, Kim M-S, Wang W. Computing distances between surfaces using line geometry. In: Pacific conference on computer graphics and applications p. 236–45.  [4]Chen Xiaodiao, etc.Computing minimum distance between two implicit algebraic surfaces. CAD, 2006; –1061.

comparison

The End!