Gauss curvature. curvature lines, needle plot. vertices of progenitor solid are unit size. Construction Principle. edge. edge. vertex. Patch.

Similar documents
3D Modeling Parametric Curves & Surfaces. Shandong University Spring 2013

3D Modeling Parametric Curves & Surfaces

On Smooth Bicubic Surfaces from Quad Meshes

Normals of subdivision surfaces and their control polyhedra

Smooth Patching of Refined Triangulations

Sung-Eui Yoon ( 윤성의 )

Finite curvature continuous polar patchworks

Until now we have worked with flat entities such as lines and flat polygons. Fit well with graphics hardware Mathematically simple

INTRODUCTION TO GRAPH THEORY. 1. Definitions

Curves and Surfaces Computer Graphics I Lecture 10

Normals of subdivision surfaces and their control polyhedra

Know it. Control points. B Spline surfaces. Implicit surfaces

Design considerations

Interactive Shape Control and Rapid Display of A- patches

INF3320 Computer Graphics and Discrete Geometry

Subdivision Curves and Surfaces: An Introduction

Interpolatory 3-Subdivision

Parametric Curves. University of Texas at Austin CS384G - Computer Graphics Fall 2010 Don Fussell

Information Coding / Computer Graphics, ISY, LiTH. Splines

Curves and Surfaces 1

CS130 : Computer Graphics Curves (cont.) Tamar Shinar Computer Science & Engineering UC Riverside

Parametric Curves. University of Texas at Austin CS384G - Computer Graphics

CS-184: Computer Graphics

Curve Corner Cutting

Polar Embedded Catmull-Clark Subdivision Surface

Convex Hulls (3D) O Rourke, Chapter 4

One simple example is that of a cube. Each face is a square (=regular quadrilateral) and each vertex is connected to exactly three squares.

Computer Graphics Curves and Surfaces. Matthias Teschner

Euler Characteristic

p y = 0 x c Figure : Stereographic projection. r p p y = 0 c p Figure : Central projection. Furthermore, we will discuss representations of entire sph

Introduction to Geometry. Computer Graphics CMU /15-662

Construct Piecewise Hermite Interpolation Surface with Blending Methods

CS354 Computer Graphics Surface Representation IV. Qixing Huang March 7th 2018

Curves, Surfaces and Recursive Subdivision

G 2 Bezier Crust on Quad Subdivision Surfaces

Smooth Bi-3 Spline Surfaces with fewest knots

MA 323 Geometric Modelling Course Notes: Day 36 Subdivision Surfaces

Surfaces for CAGD. FSP Tutorial. FSP-Seminar, Graz, November

Curves and Surfaces Computer Graphics I Lecture 9

Pairs of Bi-Cubic Surface Constructions Supporting Polar Connectivity

Parametric curves. Brian Curless CSE 457 Spring 2016

linearize discretize Galerkin optimize sample

Interactive Graphics. Lecture 9: Introduction to Spline Curves. Interactive Graphics Lecture 9: Slide 1

Local Mesh Operators: Extrusions Revisited

Triangles and Squares David Eppstein, ICS Theory Group, April 20, 2001

OUTLINE. Quadratic Bezier Curves Cubic Bezier Curves

u 0+u 2 new boundary vertex

Physically-Based Modeling and Animation. University of Missouri at Columbia

Adaptive and Smooth Surface Construction by Triangular A-Patches

Fall CSCI 420: Computer Graphics. 4.2 Splines. Hao Li.

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

The Essentials of CAGD

Introduction p. 1 What Is Geometric Modeling? p. 1 Computer-aided geometric design Solid modeling Algebraic geometry Computational geometry

Computer Graphics CS 543 Lecture 13a Curves, Tesselation/Geometry Shaders & Level of Detail

COMPUTER AIDED GEOMETRIC DESIGN. Thomas W. Sederberg

Fathi El-Yafi Project and Software Development Manager Engineering Simulation

Kai Hormann, N. Sukumar. Generalized Barycentric Coordinates in Computer Graphics and Computational Mechanics

A new 8-node quadrilateral spline finite element

Curve Representation ME761A Instructor in Charge Prof. J. Ramkumar Department of Mechanical Engineering, IIT Kanpur

implicit surfaces, approximate implicitization, B-splines, A- patches, surface fitting

Curves and Surfaces for Computer-Aided Geometric Design

Local Modification of Subdivision Surfaces Based on Curved Mesh

Near-Optimum Adaptive Tessellation of General Catmull-Clark Subdivision Surfaces

CS-184: Computer Graphics. Today

Surfaces with rational chord length parameterization

From curves to surfaces. Parametric surfaces and solid modeling. Extrusions. Surfaces of revolution. So far have discussed spline curves in 2D

Curves & Surfaces. Last Time? Progressive Meshes. Selective Refinement. Adjacency Data Structures. Mesh Simplification. Mesh Simplification

Subdivision surfaces. University of Texas at Austin CS384G - Computer Graphics Fall 2010 Don Fussell

Geometric Continuity, Feb

Subdivision Surfaces

BS-Patch: Constrained Bezier Parametric Patch

The Free-form Surface Modelling System

REGULAR POLYTOPES REALIZED OVER Q

1. CONVEX POLYGONS. Definition. A shape D in the plane is convex if every line drawn between two points in D is entirely inside D.

The goal is the definition of points with numbers and primitives with equations or functions. The definition of points with numbers requires a

Knot Insertion and Reparametrization of Interval B-spline Curves

Approximation of 3D-Parametric Functions by Bicubic B-spline Functions

Rendering Curves and Surfaces. Ed Angel Professor of Computer Science, Electrical and Computer Engineering, and Media Arts University of New Mexico

CS Object Representation. Aditi Majumder, CS 112 Slide 1

We have set up our axioms to deal with the geometry of space but have not yet developed these ideas much. Let s redress that imbalance.

Taxonomy of interpolation. constraints on recursive subdivision. Ahmad H. Nasri 1, Malcolm A. Sabin 2. 1 Introduction

Example: The following is an example of a polyhedron. Fill the blanks with the appropriate answer. Vertices:

UNIVERSITY OF CALGARY. Subdivision Surfaces. Advanced Geometric Modeling Faramarz Samavati

Computer Graphics. Curves and Surfaces. Hermite/Bezier Curves, (B-)Splines, and NURBS. By Ulf Assarsson

Week 9: Planar and non-planar graphs. 7 and 9 November, 2018

Morphing Planar Graphs in Spherical Space

Curves D.A. Forsyth, with slides from John Hart

Rational Bezier Curves

Introduction to Computer Graphics

Curve and Surface Basics

GL9: Engineering Communications. GL9: CAD techniques. Curves Surfaces Solids Techniques

Topological Issues in Hexahedral Meshing

Modeling 3D Objects: Part 2

Fairing Scalar Fields by Variational Modeling of Contours

Geometric Modeling of Curves

SEMIREGULAR PENTAGONAL SUBDIVISIONS

An introduction to interpolation and splines

Surface Modeling. Polygon Tables. Types: Generating models: Polygon Surfaces. Polygon surfaces Curved surfaces Volumes. Interactive Procedural

Lecture IV Bézier Curves

Morphing Planar Graphs in Spherical Space

Transcription:

The Platonic Spheroids Jorg Peters and Leif Kobbelt Abstract. We present a gallery of simple curvature continuous surfaces that possess the topological structure of the Platonic solids. These spherelike surfaces consist of one cubic triangular or biquadratic quadrilateral patch per vertex of the solid and interpolate the vertices of the dual solid. x. Polynomial curvature continuous surfaces Constructing low degree polynomial curvature continuous surfaces is a dicult problem. Existing parametric solutions [, 6, ] require both a large number of patches and high degree. A recent implicit curvature continuous construction requires only algebraic degree 4, but consists of many pieces [4]. On the other hand the existence of low degree (rational) curvature continues representations of shapes such as the sphere hints at the existence of elegant solutions for restricted geometric shapes. This paper describes a small family of polynomial surfaces that approximate the sphere and have the symmetry structure of Platonic polyhedra. These spheroids embody a remarkably simple construction principle: pick a Platonic polyhedron and its dual; associate with each -valent vertex of the dual a triangular patch of degree, or with each 4-valent vertex a quadrilateral patch of degree bi-. The Bernstein-Bezier control points of the spheroid patches are the face centroids, midpoints and scaled vertices of the dual. By symmetry, the spheroid interpolates the vertices of the Platonic and by scaling those of the dual Platonic. Using their simple, explicit parametrization the two highly symmetric platonic spheroids can be proven strictly convex. The table below collects basic spheroid properties. Table patches interpolates max Gauss name curvature Tetroid 4 Tetrahedron :4 Hexoid 6 Cube :9 Octoid 8 Octahedron :69 Dodecoid Icosahedron :

J. Peters, L. Kobbelt Construction Principle face vertex vertex Patch face Gauss curvature curvature lines, needle plot vertices of progenitor solid are unit size Fig.. Synopsis of patch transitions and curvature used in Sections -6. x. Guide to the gallery Each of the following four sections gives the synopsis of one platonic spheroid. Pick a Platonic solid. Its dual will be interpolated and gives the particular spheroid its name. The part closer to a vertex V of the original Platonic solid is covered by a single patch (there is no dodecoid since that would require a -sided patch). The complete surface is obtained by applying the operations of the solid's symmetry group (see e.g. []) to this one patch. The patch associated with V has quadratic boundary curves and one interior control point. Each boundary curve connects the centroids of two -adjacent facets attached to V and uses the midpoint of their common as middle coecient of the quadratic curve in Bezier form. If V is three-valent, the Bezier representation of the boundaries are degree-raised. The control point of the biquadratic or cubic patch is always a multiple of V. Besides the representative patch, each synopsis shows, in the upper left sketch, the facet centroids, midpoints and the two vertices that determine the tangent plane common to two patches, say p and q. Tangent continuity of the surface follows from the existence of a linear scalar polynomial such that the versal derivative D p along the common of p and q is a linear combination of the transversal derivatives D p and D q across the common, here parametrized by u. In symbols p(u; ) = q(u; ) and (u)d p(u; ) = D p(u; ) + D q(u; ): In the synopsis, the coecients of D i p are collected in a matrix. The upper right gure shows the spheroid textured by Gauss curvature, curvature lines and a needle plot proportional to the curvature. The normalization is chosen so that the vertices of the name-giving Platonic solid are on the unit sphere. Scale and maximal curvature are displayed on the right. Since the surfaces are symmetric across the s and vertices, rst order smoothness implies that the transitions are also curvature continuous. Finally, the positivity of all Bezier coecients in numerator and denominator of the expression for Gauss curvature establishes convexity of octoid and icosoid.

- 9-9 9 - - 9-9 - Fig.. Coecients and Gauss curvature of the Tetroid. x. The Tetroid A representative cubic patch has the Bezier coecients 4? 4? 4???7?7 4?7? 4??7 4??? 4?? 4?7? 4?7? 4?? The smoothness is characterized by D p(u; ) = 4 6?6 ; D p(u; ) = 4 6? 4?6 ;?? 4?4? D q(u; ) = 4? 4?6??6 and hence D p(u; ) + D q(u; ) = [?(? u) + u]d p(u; ).

4 J. Peters, L. Kobbelt - 7 - - 7 Fig. 4. Coecients and Gauss curvature of the Hexoid. x4. The Hexoid A representative biquadratic patch has the Bezier coecients 4?? 4? 4? 4? 4 4 7 4? 4 4 The smoothness is characterized by D p(u; ) = 4? ; D p(u; ) = 4????? 4 D q(u; ) = 4? 4??? and hence D p(u; ) + D q(u; ) = [?(? u) + u]d p(u; ): ;

- - - Fig.. Coecients and Gauss curvature of the Octoid. x. The Octoid A representative cubic patch has the Bezier coecients 4 4 4 4 4 4 4 4 4 4 The smoothness is characterized by D p(u; ) = 4 ; D p(u; ) = 4????? D q(u; ) = 4? and hence D p(u; ) + D q(u; ) = ud p(u; ): The surface is convex. ;

6 J. Peters, L. Kobbelt +t +s a +s +t +t t+ +s +t t+ +t t a s - t +s +t s = /t a = (9+t)/(9+t) Fig. 6. Coecients and Gauss curvature of the Icosoid. x6. The Icosoid With t := ( p + )=, s := =t, and := (7 + t)=( + 4t), a representative cubic patch has the Bezier coecients 4 + t + t 4 t? 4 4? + 6t 4 6t + 4 8t? 6t + 4 4 4 6t + 4 + t 4 8t? 6t + 4 t?? + 6t 4 + t 8t? 6t + 4 4 t? 6t + 4 + t? + 6t + t With := (8 + t)=( + 4t), the smoothness is characterized by =? =t? D p(u; ) = 4 + s 6=t? =? s and =? =t?=? =t D p(u; ) = + 6t? 4? t s 4?? s t? s 6 + s? t?? 6t?t and symmetrically for D q(u; ) so that D p(u; ) + D q(u; ) = [s(? u) + (? s)u]d p(u; ). The surface is convex.

x7. Remarks and extensions. It may be argued that the spheroids are a local curvature continuous construction of minimal degree since non-at polynomial boundary curves need to be at least quadratic, and the patches require just one additional inner vertex. With a few minor exceptions, the formulas presented here were derived, checked and typeset using symbolic programs. In particular, the scaling of the central patch coecients was determined using the determinant condition, det[d p; Dp; Dq] =, thus conrming rst order continuity independently from the smoothness proof by reparametrization. Scaled versions of the dodecoid interpolate the vertices of any Platonic solid. The spheroid properties are preserved under global ane transformations. Acknowledgments. The rst author is supported by NSF NYI grant 94786-CCR. The curvature images were generated using Surfacer, a product of Imageware. References. [] Alfeld, P, M. Neamtu, L. L. Schumaker, Bernstein-Bezier Polynomials on Spheres and Sphere-Like Surfaces CAGD (996), {49.. [] Coxeter, H. S. M. Regular Polytopes, Dover Publications, New York, 97.. [] Peters, J, Curvature continuous spline surfaces over irregular meshes Comput. Aided Geom. Design (996), {. 4. [4] Peters,J, M. Wittman Box-spline based CSG blends, Proceedings of Fourth Symposium on Solid Modeling, C. Homann, W. Bronsvort (eds.), ACM Siggraph, ACM order number 49974, (997), 9{6.. [] H. Prautzsch, Free-form splines, Comput. Aided Geom. Design 4 (997), -6. 6. [6] Reif,U., TURBS - topologically unrestricted B-splines, Constructive Approximation, to appear, (99x), xxx-xxx. Jorg Peters Dept of Computer Sciences Purdue University W-Lafayette IN 4797-98 jorg@cs.purdue.edu http://www.cs.purdue.edu/people/jorg Leif Kobbelt Computer Graphics Group Computer Sciences Department University of Erlangen-N"urnberg Am Weichselgarten 9 kobbelt@immd9.informatik.uni-erlangen.de 7