Meshing the hyperbolic octagon

Similar documents
X-Kaapi C programming interface

Periodic meshes for the CGAL library

A generator of random convex polygons in a disc

A Voronoi-Based Hybrid Meshing Method

An Experimental Assessment of the 2D Visibility Complex

BoxPlot++ Zeina Azmeh, Fady Hamoui, Marianne Huchard. To cite this version: HAL Id: lirmm

Quasi-tilings. Dominique Rossin, Daniel Krob, Sebastien Desreux

Computing and maximizing the exact reliability of wireless backhaul networks

The Proportional Colouring Problem: Optimizing Buffers in Radio Mesh Networks

Relabeling nodes according to the structure of the graph

Delaunay Triangulations of Points on Circles

Multimedia CTI Services for Telecommunication Systems

Every 3-connected, essentially 11-connected line graph is hamiltonian

Deformetrica: a software for statistical analysis of anatomical shapes

An Efficient Numerical Inverse Scattering Algorithm for Generalized Zakharov-Shabat Equations with Two Potential Functions

Fuzzy sensor for the perception of colour

Study on Feebly Open Set with Respect to an Ideal Topological Spaces

The Voronoi diagram of three arbitrary lines in R3

DETERMINATION OF THE TRANSDUCER VELOCITIES IN A SONAR ARRAY USING DIGITAL ACOUSTICAL HOLOGRAPHY

Comparison of spatial indexes

Tacked Link List - An Improved Linked List for Advance Resource Reservation

Traffic Grooming in Bidirectional WDM Ring Networks

Mokka, main guidelines and future

Comparison of radiosity and ray-tracing methods for coupled rooms

Moveability and Collision Analysis for Fully-Parallel Manipulators

HySCaS: Hybrid Stereoscopic Calibration Software

Does disabling Wi-Fi prevent my Android phone from sending Wi-Fi frames?

Faster Triangle-Triangle Intersection Tests

Kernel perfect and critical kernel imperfect digraphs structure

Real-Time Collision Detection for Dynamic Virtual Environments

Linux: Understanding Process-Level Power Consumption

Efficient implementation of interval matrix multiplication

Assisted Policy Management for SPARQL Endpoints Access Control

Fault-Tolerant Storage Servers for the Databases of Redundant Web Servers in a Computing Grid

CGAL - The Computational Geometry Algorithms Library

Real-time FEM based control of soft surgical robots

Mesh generation from 3D multi-material images

Blind Browsing on Hand-Held Devices: Touching the Web... to Understand it Better

Taking Benefit from the User Density in Large Cities for Delivering SMS

SDLS: a Matlab package for solving conic least-squares problems

Minor-monotone crossing number

Natural Language Based User Interface for On-Demand Service Composition

Comparator: A Tool for Quantifying Behavioural Compatibility

QuickRanking: Fast Algorithm For Sorting And Ranking Data

Setup of epiphytic assistance systems with SEPIA

Extended interface ID for virtual link selection in GeoNetworking to IPv6 Adaptation Sub-layer (GN6ASL)

Feature-Based Facial Expression Recognition: Experiments With a Multi-Layer Perceptron

Workspace and joint space analysis of the 3-RPS parallel robot

Representation of Finite Games as Network Congestion Games

DANCer: Dynamic Attributed Network with Community Structure Generator

Linked data from your pocket: The Android RDFContentProvider

XML Document Classification using SVM

How to simulate a volume-controlled flooding with mathematical morphology operators?

THE COVERING OF ANCHORED RECTANGLES UP TO FIVE POINTS

Acyclic Coloring of Graphs of Maximum Degree

The Connectivity Order of Links

COM2REACT: V2V COMMUNICATION FOR COOPERATIVE LOCAL TRAFFIC MANAGEMENT

Scalewelis: a Scalable Query-based Faceted Search System on Top of SPARQL Endpoints

Service Reconfiguration in the DANAH Assistive System

An FCA Framework for Knowledge Discovery in SPARQL Query Answers

An Object Oriented Finite Element Toolkit

Malware models for network and service management

Regularization parameter estimation for non-negative hyperspectral image deconvolution:supplementary material

lambda-min Decoding Algorithm of Regular and Irregular LDPC Codes

Light field video dataset captured by a R8 Raytrix camera (with disparity maps)

Structuring the First Steps of Requirements Elicitation

KeyGlasses : Semi-transparent keys to optimize text input on virtual keyboard

Prototype Selection Methods for On-line HWR

Accurate Conversion of Earth-Fixed Earth-Centered Coordinates to Geodetic Coordinates

ASAP.V2 and ASAP.V3: Sequential optimization of an Algorithm Selector and a Scheduler

Fast and precise kinematic skeleton extraction of 3D dynamic meshes

QAKiS: an Open Domain QA System based on Relational Patterns

YAM++ : A multi-strategy based approach for Ontology matching task

Kernel-Based Laplacian Smoothing Method for 3D Mesh Denoising

Hamilton Cycle Decomposition of the Butterfly Network

MUTE: A Peer-to-Peer Web-based Real-time Collaborative Editor

A Practical Evaluation Method of Network Traffic Load for Capacity Planning

Generic Design Space Exploration for Reconfigurable Architectures

A Generic Architecture of CCSDS Low Density Parity Check Decoder for Near-Earth Applications

Implementing an Automatic Functional Test Pattern Generation for Mixed-Signal Boards in a Maintenance Context

Decomposition of a curve into arcs and line segments based on dominant point detection

Modularity for Java and How OSGi Can Help

Symmetric bipartite graphs and graphs with loops

Induced minors and well-quasi-ordering

Very Tight Coupling between LTE and WiFi: a Practical Analysis

The optimal routing of augmented cubes.

Is GPU the future of Scientific Computing?

CORON: A Framework for Levelwise Itemset Mining Algorithms

Teaching Encapsulation and Modularity in Object-Oriented Languages with Access Graphs

EFFICIENCY OF HIGHER ORDER FINITE ELEMENTS FOR THE ANALYSIS OF SEISMIC WAVE PROPAGATION

BugMaps-Granger: A Tool for Causality Analysis between Source Code Metrics and Bugs

Interaction between ring shaped permanent magnets with symbolic gradients: application to magnetic bearing system optimization

Branch-and-price algorithms for the Bi-Objective Vehicle Routing Problem with Time Windows

Squaring the Circle with Weak Mobile Robots

Self-optimisation using runtime code generation for Wireless Sensor Networks Internet-of-Things

Stream Ciphers: A Practical Solution for Efficient Homomorphic-Ciphertext Compression

The SANTE Tool: Value Analysis, Program Slicing and Test Generation for C Program Debugging

IP Simulator User Guide

Open Digital Forms. Hiep Le, Thomas Rebele, Fabian Suchanek. HAL Id: hal

FIT IoT-LAB: The Largest IoT Open Experimental Testbed

Transcription:

Meshing the hyperbolic octagon Mathieu Schmitt, Monique Teillaud To cite this version: Mathieu Schmitt, Monique Teillaud. Meshing the hyperbolic octagon. [Research Report] RR- 8179, INRIA. 2012. <hal-00764965> HAL Id: hal-00764965 https://hal.inria.fr/hal-00764965 Submitted on 13 Dec 2012 HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.

Meshing the hyperbolic octagon Mathieu Schmitt, Monique Teillaud RESEARCH REPORT N 8179 December 2012 Project-Team Geometrica ISSN 0249-6399 ISRN INRIA/RR--8179--FR+ENG

Meshing the hyperbolic octagon Mathieu Schmitt, Monique Teillaud Project-Team Geometrica Research Report n 8179 December 2012 8 pages Abstract: This short report describes a preliminary study of a method computing meshes of the standard hyperbolic octagon that respects its symmetries. A prototype software was written, using the 2D meshing package of the CGAL library [1, 10] and a software computing hyperbolic triangulations, currently under development [4]. Key-words: Hyperbolic geometry, Poincaré disk, Schwarz triangle, mesh This work was done while the first author was working as an intern student at INRIA RESEARCH CENTRE SOPHIA ANTIPOLIS MÉDITERRANÉE 2004 route des Lucioles - BP 93 06902 Sophia Antipolis Cedex

Maillages de l octogone hyperbolique Résumé : Ce court rapport décrit une étude préliminaire d une méthode permettant de calculer des maillages de l octogone hyperbolique qui respecte ses symétries. Un logiciel prototype a été réalisé, utilisant le module de maillages 2D de la bibliothèque CGAL [1, 10] et un logiciel de calcul de triangulations hyperboliques en cours de développememnt [4]. Mots-clés : Géométrie hyperbolique, disque de Poincaré, triangle de Schwarz, maillage

Meshing the hyperbolic octagon 3 1 Introduction Hyperbolic octagon. The hyperbolic octagon [2] and its meshes have been used in very various fields, see eg., [3, 8]. They are often generated in quite a manual way, and they do not fulfill the symmetry properties that actually are required for the application. As far as we know, no available software allows to compute such a mesh in an automatic way. We consider the unit octagon O in the Poincaré disk of the hyperbolic plane H 2 (see Figure 1) [6, 5]. The octagon can be seen as the fundamental domain of the action of the finitely presented group G = a,b,c,d ababcdcd on H 2, where a,b,c,d are hyperbolic translations (see Figure 2). a b b a 0 c d d c Figure 1: Hyperbolic octagon. G can be thought of as the quotient of the free group F = a,b,c,d by the normal closure of R = {ababcdcd} in F. O is also the Voronoi cell of the origin O in the Voronoi diagram of the set GO of its images by elements of G. O tiles H 2, ie., all images of O by elements of G form a partition of H 2. Hyperbolic Delaunay triangulations. We refer the reader to [4]. 2 Meshing the octagon 2.1 Basic mesh The CGAL 2D mesh package implements a Delaunay refinement algorithm [10] to mesh a shape defined by a set of given constrained edges in the Euclidean plane. In a nutshell, a quality criterion can be given by the user, and the algorithm refines triangles and constrained edges as long as they do not all satisfy the criterion. A triangles is refined by inserting its (Euclidean) circumcenter in the Delaunay triangulation, while a constrained edge is refined by inserting its (Euclidean) midpoint. We propose to reuse the package, adapting it to the hyperbolic case. RR n 8179

4 M. Schmitt & M. Teillaud fixed points ab au aa a bau b abau ab aa a 0 u Figure 2: Hyperbolic translation a. The flexibility of CGAL allows us to do so by changing the so-called Traits class, which provides the algorithm with basic geometric predicates and constructions. Instead of the default traits class of the package, which provides Euclidean constructions, we plug a new traits class providing constructions in the hyperbolic plane. The geometric constructions, in the hyperbolic plane, of the bisector of a line segment (represented as a a circular arc in the Poincaré disk), and of the circumcenter of a triangle, are explained in [4]. The midpoint of a line segment can be obtained by intersecting it with its bisecting line. In a similar way, we can modify the quality criterion that the mesh package uses to stop the refinement. We replace it by a criterion on the hyperbolic size of a triangle. The area of a hyperbolictriangle is equal toπ Σα, whereσα denotes the sum ofits angles [6, 5] (see Figure3). Such angles can be easily computed using the standard propery that the angle between a chord O A C B Figure 3: The area of the hyperbolic (red) triangle ABC is the difference between the sum of angles of the Euclidean (blue) triangle and its own sum of angles. and the tangent at a vertex is the same as half the angle at the center (see Figure 4). Note that these computations make an extensive use of the fact that the Poincaré disk is a conformal Inria

Meshing the hyperbolic octagon 5 A B O Figure 4: Property of angles. model of the hyperbolic plane: it preserves angles. Figure 5 shows an example of a mesh provided in this way. Visually, the mesh looks a bit denser at the boundaries of the octagon than at its centers: all triangles have the same hyperbolic area (up to arithmetic rounding). Figure 5: Basic mesh. 2.2 Adding symmetries The Schwarz triangle T(k,l,m), for 1 k + 1 l + 1 m < 1, is the hyperbolic triangle with angles π/k, π/l and π/m. Note that in hyperbolic geometry, the angles of a triangle uniquely define it, up to isometry. The group of a Schwarz triangle T(k,l,m) is the group of isometries generated by the reflexions with respect to its edges. Under the action of its group, the Schwarz triangle T(8,3,2) tiles the octagon (see Figure 6). Hence, from the properties of the octagon mentioned in introduction, it tiles H 2. Reflexions with respect to a hyperbolic line segment AB are computed in the following way. If AB is supported by a diameter of the Poincaré disk, then the hyperbolic reflexion is a Euclidean reflexion. If AB is supported by a Euclidean circle C of center c and radius r, then the reflexion RR n 8179

6 M. Schmitt & M. Teillaud Figure 6: The Schwarz triangle T(8,3,2) and the octagon (figure from [9]). is the inversion defined by C: point M is mapped to M such that cm cm = r 2 and c,m,m are collinear. Ou method consists in Computing a mesh of the Schwarz triangle as explained in the previous section, Applying reflexions until the octagon is filled (there are 96 such reflexions) A result can be seen in Figure 7. In [9, 7], a Euclidean mesh is computed in the Schwarz triangle T(8,3,2) using Matlab, by considering that the central triangle is close enough to the center of the Poincaré disk so that the hyperbolic distance can be approximated by the Euclidean distance. This approximation is in fact not precise enough, and the mesh is too sparse close to the boundaries of the octagon. To try to hide this problem, more points are added close to the center, so that more points appear after reflexions close to the boundaries. See Figure 8. Since we are perfoming the Delaunay refinement using constructions in the hyperbolic plane, our method does not need any manual tuning, and it automatically provides a mesh that respects both the hyperbolic sizing criterion and the symmetries, and which can be as fine as needed. 3 Conclusion and future work The results obtained by this first study show that the approach goes in the right direction. Still, the current prototype implementation is flawn by arithmetic issues: when computing the midpointofahyperboliclinesegment, thismidpointisroundedandinfactdoesnotexactlylieon the segment; then it is not a fixed point through the reflexion with respect to this segment. This generates two points that are very close, but different, which must be fixed. Such improvements will allow to release the software in CGAL, maybe as a demo of the package on hyperbolic Delaunay triangulations in preparation [4]. A higher level open question is to generalize the method and make the software generic so that it can handle any Schwarz triangle. This would allow to compute meshes of any fundamental polygon tiling the hyperbolic plane by the action of a Fuchsian group on H 2. Inria

Meshing the hyperbolic octagon 7 Figure 7: Mesh with symmetries. Figure 8: Mesh obtained in [9, 7]. RR n 8179

8 M. Schmitt & M. Teillaud References [1] Cgal, Computational Geometry Algorithms Library. http://www.cgal.org. [2] R. Aurich, E.B. Bogomolny, and F. Steiner. Periodic orbits on the regular hyperbolic octagon. Physica D, 48:91 101, 1991. [3] Agnès Bachelot-Motet. Wave computation on the hyperbolic double doughnut. J. Comp. Math., 28:790 806, 2010. http://arxiv.org/abs/0902.1249. [4] Mikhail Bogdanov, Olivier Devillers, and Monique Teillaud. Hyperbolic Delaunay complexes and Voronoi diagrams made practical. Research Report 8146, INRIA, 2012. http://hal.inria.fr/hal-00756522. [5] James W. Cannon, William J. Floyd, Richard Kenyon, and Walter R. Parry. Hyperbolic geometry. Flavors of geometry, 31:59 115, 1997. [6] André Cérézo. Le plan hyperbolique à pied, puis un bond dans l espace. Publications Pédagogiques, 1991. [7] Pascal Chossat, Grégory Faye, and Olivier Faugeras. Bifurcation of hyperbolic planforms. Journal of Nonlinear Science, 21:465 498, 2011. http://link.springer.com/article/10.1007%2fs00332-010-9089-3. [8] G. Faye, P. Chossat, and O. Faugeras. Some theoretical results for a class of neural mass equations. Technical report, 2010. http://arxiv.org/abs/1005.0510. [9] Grégorie Faye. Symmetry breaking and pattern formation in some neural field equations. PhD thesis, University of Nice-Sophia Antipolis, 2012. [10] Laurent Rineau. 2D conforming triangulations and meshes. In CGAL Editorial Board, editor, CGAL User and Reference Manual. 4.1 edition, 2012. http://www.cgal.org/manual/latest/doc_html/cgal_manual/pkgdescription.html#pkg:mesh2. Inria

RESEARCH CENTRE SOPHIA ANTIPOLIS MÉDITERRANÉE 2004 route des Lucioles - BP 93 06902 Sophia Antipolis Cedex Publisher Inria Domaine de Voluceau - Rocquencourt BP 105-78153 Le Chesnay Cedex inria.fr ISSN 0249-6399