restricted voronoi diagrams
play

Restricted Voronoi Diagrams for (re)meshing Surfaces and Volumes - PowerPoint PPT Presentation

Apr 19, 2023 •266 likes •1.64k views

Mathmatiques - Informatique Restricted Voronoi Diagrams for (re)meshing Surfaces and Volumes Curves and Surfaces 2014 Bruno Lvy ALICE Gomtrie & Lumire CENTRE INRIA Nancy Grand-Est OVERVIEW Part. 1. Introduction Motivations The

  1. Part. 2 Exact Arithmetics How to implement Side1(), Side2(), Side3() ? +,-,*,Sign() Idea #1: (dense) multi-precision (GMP) c = a 10 * 2 10*32 + b 0 a10 0 0 b0 x 2 10*32 x 2 0

  2. Part. 2 Exact Arithmetics How to implement Side1(), Side2(), Side3() ? +,-,*,Sign() Idea #2: (sparse) multi-precision c = a 10 * 2 10*32 + b 0 a10 | 10 b0 | 0 Store the exponents of the components

  3. Part. 2 Exact Arithmetics How to implement Side1(), Side2(), Side3() ? +,-,*,Sign() Idea #2: (sparse) multi-precision c = a 10 * 2 10*32 + b 0 a10 | 10 b0 | 0 Exp. Exp.

  4. Part. 2 Exact Arithmetics How to implement Side1(), Side2(), Side3() ? +,-,*,Sign() Idea #2: (sparse) multi-precision c = a 10 * 2 10*32 + b 0 a10 | 10 b0 | 0 mantissa Exp. mantissa Exp.

  5. Part. 2 Exact Arithmetics How to implement Side1(), Side2(), Side3() ? +,-,*,Sign() Idea #2: (sparse) multi-precision c = a 10 * 2 10*32 + b 0 a10 | 10 b0 | 0 mantissa Exp. mantissa Exp. These are floating point numbers !!!

  6. Part. 2 Exact Arithmetics How to implement Side1(), Side2(), Side3() ? +,-,*,Sign() Idea #3: expansions (Shewchuk) x3 x1 x2 These are floating point numbers !!!

  7. Part. 2 Exact Arithmetics How to implement Side1(), Side2(), Side3() ? +,-,*,Sign() Idea #3: expansions (Shewchuk) x3 x1 x2 They are sorted in decreasing exponents These are floating point numbers !!!

  8. Part. 2 Exact Arithmetics How to implement Side1(), Side2(), Side3() ? +,-,*,Sign() Idea #3: expansions (Shewchuk) x3 x1 x2 They are sorted in decreasing exponents - These are floating point numbers !!!

  9. Part. 2 Exact Arithmetics How to implement Side1(), Side2(), Side3() ? +,-,*,Sign() Idea #3: expansions (Shewchuk) x3 x1 x2 They are sorted in decreasing exponents - The sign is determined by the first component (highest exponent) These are floating point numbers !!!

  10. Part. 2 Exact Arithmetics How to implement Side1(), Side2(), Side3() ? +,-,*,Sign() Idea #3: expansions (Shewchuk) Two_sum(double a, double b) x1 x2

  11. Part. 2 Exact Arithmetics How to implement Side1(), Side2(), Side3() ? +,-,*,Sign() Idea #3: expansions (Shewchuk) Two_sum(double a, double b) x1 x2 Length: + l+m Length l Length m

  12. Part. 2 Exact Arithmetics How to implement Side1(), Side2(), Side3() ? +,-,*,Sign() Idea #3: expansions (Shewchuk) Two_sum(double a, double b) x1 x2 Length: + l+m Length: * 2*l A double Length l

  13. Part. 2 Exact Arithmetics How to implement Side1(), Side2(), Side3() ? +,-,*,Sign() Idea #3: expansions (Shewchuk) * Length m Length l Length: 2*l*m Expansion * Expansion product implemented by a recursive function

  14. Part. 2 Exact Arithmetics How to implement Side1(), Side2(), Side3() ? +,-,*,Sign() Idea #3: expansions (Shewchuk) * Length m Length l Length: 2*l*m Expansion * Expansion product implemented by a recursive function Performance ? 10 to 40 times slower than standard doubles

  15. Part. 2 Exact Arithmetics How to implement Side1(), Side2(), Side3() ? +,-,*,Sign() Idea #3: expansions (Shewchuk) * Length m Length l Length: 2*l*m Expansion * Expansion product implemented by a recursive function Performance ? 10 to 40 times slower than standard doubles Use arithmetic filters Adaptive precision [Shewchuk] ? Too complicated to get right

  16. Part. 2 Exact Arithmetics How to implement Side1(), Side2(), Side3() ? +,-,*,Sign() Idea #3: expansions (Shewchuk) * Length m Length l Length: 2*l*m Expansion * Expansion product implemented by a recursive function Performance ? 10 to 40 times slower than standard doubles Use arithmetic filters Adaptive precision [Shewchuk] ? Too complicated to get right Quasi-static filters [Meyer and Pion] FPG generator (easy to use)

  17. Part. 2 Exact Arithmetics How to implement Side1(), Side2(), Side3() ? +,-,*,Sign() PCK (Predicate Construction Kit) multi_precision.h / multi_precision.cpp - - +,-,*,Sign overloads) a script that generates the filter with FPG [Meyer and Pion] and the exact precision version with expansions

  18. Part. 2 Exact Arithmetics How to implement Side1(), Side2(), Side3() ? +,-,*,Sign() PCK (Predicate Construction Kit) multi_precision.h / multi_precision.cpp - - +,-,*,Sign overloads) a script that generates the filter with FPG [Meyer and Pion] and the exact precision version with expansions So we are done ?

  19. Part. 2 Symbolic Perturbation How to implement Side1(), Side2(), Side3() ? x j x i Not yet !!

  20. Part. 2 Symbolic Perturbation How to implement Side1(), Side2(), Side3() ? x j x i Not yet !!

  21. Part. 2 Symbolic Perturbation

  22. Part. 2 Symbolic Perturbation

  23. Part. 2 Symbolic Perturbation

  24. Part. 2 Symbolic Perturbation

  25. Part. 2 Symbolic Perturbation

  26. Part. 2 Symbolic Perturbation

  27. Part. 2 Symbolic Perturbation

  28. Part. 2 Symbolic Perturbation

  29. Part. 2 Symbolic Perturbation

  30. Part. 2 Symbolic Perturbation

  31. Part. 2 Symbolic Perturbation

  32. Part. 2 Symbolic Perturbation

  33. Part. 2 Symbolic Perturbation

  34. Part. 2 Symbolic Perturbation

  35. Part. 2 Symbolic Perturbation

  36. Part. 2 Symbolic Perturbation

  37. Part. 2 Symbolic Perturbation (i,j) = { p | d 2 ( p , x i ) = d 2 ( p , x j )} x j [Voronoi] x i [Edelsbrunner et.al] [Devillers et.al]

  38. Part. 2 Symbolic Perturbation w (i,j) = { p | d 2 ( p , x i ) - w i = d 2 ( p , x j ) - w j } x j [Voronoi] x i [Edelsbrunner et.al] [Devillers et.al]

  39. Part. 2 Symbolic Perturbation w (i,j) = { p | d 2 ( p , x i ) - w i = d 2 ( p , x j ) - w j } The Voronoi diagram is replaced with a power diagram x j [Voronoi] x i [Edelsbrunner et.al] [Devillers et.al]

  40. Part. 2 Symbolic Perturbation w (i,j) = { p | d 2 ( p , x i ) - w i = d 2 ( p , x j ) - w j } The Voronoi diagram is replaced with a power diagram Symbolic perturbation Simulation of Simplicity: Define the weight as a function of : w i = i x j [Voronoi] x i [Edelsbrunner et.al] [Devillers et.al]

  41. Part. 2 Symbolic Perturbation w (i,j) = { p | d 2 ( p , x i ) - w i = d 2 ( p , x j ) - w j } The Voronoi diagram is replaced with a power diagram Symbolic perturbation Simulation of Simplicity: Define the weight as a function of : w i = i The combinatorics is determined by the limit x j [Voronoi] x i [Edelsbrunner et.al] [Devillers et.al]

  42. Part. 2 Symbolic Perturbation How to write side1(), side2(), side3(), side4() ? d 2 ( q , p j )-w j d 2 ( q , p i ) + w i where: q = w(i,k 1 w(i,k d 1 ,p 2 ,p 3 d ]

  43. Part. 2 Symbolic Perturbation How to write side1(), side2(), side3(), side4() ? d 2 ( q , p j )-w j d 2 ( q , p i ) + w i where: q = w(i,k 1 w(i,k d 1 ,p 2 ,p 3 d ] q w (i,k 1 ) { Solve for q in: q w (i,k d ) [p 1 ,p 2 ,p 3 d ] q

  44. Part. 2 Symbolic Perturbation How to write side1(), side2(), side3(), side4() ? d 2 ( q , p j )-w j d 2 ( q , p i ) + w i where: q = w(i,k 1 w(i,k d 1 ,p 2 ,p 3 d ] q = (1/d) Q q w (i,k 1 ) { Solve for q in: Keep numerator and denom. q w (i,k d ) separate (remember, we are [p 1 ,p 2 ,p 3 d ] not allowed to divide) q

  45. Part. 2 Symbolic Perturbation How to write side1(), side2(), side3(), side4() ? d 2 ( q , p j )-w j d 2 ( q , p i ) + w i where: q = w(i,k 1 w(i,k d 1 ,p 2 ,p 3 d ] q = (1/d) Q q w (i,k 1 ) { Solve for q in: Keep numerator and denom. q w (i,k d ) separate (remember, we are [p 1 ,p 2 ,p 3 d ] not allowed to divide) q Inject q=(1/d) Q in side1() and mutliply by d to remove the division

  46. Part. 2 Symbolic Perturbation How to write side1(), side2(), side3(), side4() ? d 2 ( q , p j )-w j d 2 ( q , p i ) + w i where: q = w(i,k 1 w(i,k d 1 ,p 2 ,p 3 d ] q = (1/d) Q q w (i,k 1 ) { Solve for q in: Keep numerator and denom. q w (i,k d ) separate (remember, we are [p 1 ,p 2 ,p 3 d ] not allowed to divide) q Inject q=(1/d) Q in side1() and mutliply by d to remove the division Order the terms in w i = i

  47. Part. 2 Symbolic Perturbation How to write side1(), side2(), side3(), side4() ? d 2 ( q , p j )-w j d 2 ( q , p i ) + w i where: q = w(i,k 1 w(i,k d 1 ,p 2 ,p 3 d ] q = (1/d) Q q w (i,k 1 ) { Solve for q in: Keep numerator and denom. q w (i,k d ) separate (remember, we are [p 1 ,p 2 ,p 3 d ] not allowed to divide) q Inject q=(1/d) Q in side1() and mutliply by d to remove the division Order the terms in w i = i the constant one is non-perturbed predicate if zero, the first non-zero one determines the sign

  48. Part. 2 Symbolic Perturbation side1 #include "kernel.pckh" Sign predicate(side1)( point(p0), point(p1), point(q0) DIM ) { scalar r = sq_dist(p0,p1) ; r -= 2*dot_at(p1,q0,p0) ; generic_predicate_result(sign(r)) ; begin_sos2(p0,p1) sos(p0,POSITIVE) sos(p1,NEGATIVE) end_sos } Source PCK

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

Computational Geometry Lecture 13: More on Voronoi diagrams Computational Geometry Lecture 13:

Computational Geometry Lecture 13: More on Voronoi diagrams Computational Geometry Lecture 13:

Voronoi diagrams of line segments Farthest-point Voronoi diagrams More on Voronoi diagrams Computational Geometry Lecture 13: More on Voronoi diagrams Computational Geometry Lecture 13: More on Voronoi diagrams Motion planning for a disc

1.69k views • 92 slides
Voronoi diagrams Marko Tht Content Voronoi diagram Delauney triangulation How to

Voronoi diagrams Marko Tht Content Voronoi diagram Delauney triangulation How to

Voronoi diagrams Marko Tht Content Voronoi diagram Delauney triangulation How to create Voronoi diagram Uses of voronoi diagrams Voronoi diagram Voronoi diagram is partitioning of space into areas based on distance to

745 views • 31 slides
Computational Geometry Lecture 10: Voronoi diagrams Computational Geometry Lecture 10: Voronoi

Computational Geometry Lecture 10: Voronoi diagrams Computational Geometry Lecture 10: Voronoi

Motivation Voronoi diagrams Voronoi diagrams Computational Geometry Lecture 10: Voronoi diagrams Computational Geometry Lecture 10: Voronoi diagrams Motivation Voronoi diagrams Voronoi diagrams Spatial interpolation Voronoi diagram Given

1.14k views • 77 slides
Computational Geometry Lecture 10: Voronoi diagrams 1 Computational Geometry Lecture 10:

Computational Geometry Lecture 10: Voronoi diagrams 1 Computational Geometry Lecture 10:

Motivation Voronoi diagrams Voronoi diagrams Computational Geometry Lecture 10: Voronoi diagrams 1 Computational Geometry Lecture 10: Voronoi diagrams Motivation Voronoi diagrams Voronoi diagrams Spatial interpolation Voronoi diagram

985 views • 77 slides
Th The Pos ost t Off ffice ice Probl oblem em Nafiseh Mohkam Yazd University Computer

Th The Pos ost t Off ffice ice Probl oblem em Nafiseh Mohkam Yazd University Computer

Definition and Basic Properties Computing the Voronoi Diagram Voronoi Diagrams of Line Segments Farthest-Point Voronoi Diagrams Vor oron onoi oi Dia iagrams ams Th The Pos ost t Off ffice ice Probl oblem

596 views • 48 slides
Lecture 7: Voronoi Diagrams Presented by Allen Miu 6.838 Computational Geometry September 27,

Lecture 7: Voronoi Diagrams Presented by Allen Miu 6.838 Computational Geometry September 27,

Lecture 7: Voronoi Diagrams Presented by Allen Miu 6.838 Computational Geometry September 27, 2001 Post Office: What is the area of service? p i : site points q : free point e : Voronoi edge v : Voronoi vertex v q e p i Definition of

1.27k views • 79 slides
Computational Geometry Lecture 10: Voronoi diagrams Computational Geometry Lecture 10: Voronoi

Computational Geometry Lecture 10: Voronoi diagrams Computational Geometry Lecture 10: Voronoi

Motivation Voronoi diagrams Other Voronoi Diagrams More Applications.. Voronoi diagrams Computational Geometry Lecture 10: Voronoi diagrams Computational Geometry Lecture 10: Voronoi diagrams Motivation Voronoi diagrams Voronoi diagrams

957 views • 82 slides
Farthest-polygon Voronoi diagrams Otfried Cheong, Hazel Everett, Marc Glisse, Joachim

Farthest-polygon Voronoi diagrams Otfried Cheong, Hazel Everett, Marc Glisse, Joachim

Farthest-polygon Voronoi diagrams Otfried Cheong, Hazel Everett, Marc Glisse, Joachim Gudmundsson, Samuel Hornus, Sylvain Lazard, Mira Lee and Hyeon-Suk Na ESA October 2007 KAIST, INRIA, NICTA, Soongsil U. Voronoi diagrams Given some sites

655 views • 33 slides
Topological Considerations for the Incremental Computation of Voronoi Diagrams of Straight-Line

Topological Considerations for the Incremental Computation of Voronoi Diagrams of Straight-Line

Introduction Selecting a seed node Removing a tree of Voronoi edges References Topological Considerations for the Incremental Computation of Voronoi Diagrams of Straight-Line Segments and Circular Arcs Martin Held Stefan Huber University of

498 views • 36 slides
Computational Geometry Exercise session #7: Voronoi diagrams Fields of applications of

Computational Geometry Exercise session #7: Voronoi diagrams Fields of applications of

Computational Geometry Exercise session #7: Voronoi diagrams Fields of applications of Voronoi Diagrams Applications: 1. The largest empty circle problem 2. Euclidean minimum spanning trees 3. Euclidean traveling salesman problem 4.

367 views • 10 slides
Voronoi Diagrams Robust and Efficient implementation Masters Thesis Defense Nirav Patel

Voronoi Diagrams Robust and Efficient implementation Masters Thesis Defense Nirav Patel

Voronoi Diagrams Robust and Efficient implementation Masters Thesis Defense Nirav Patel Binghamton University Department of Computer Science Thomas J. Watson School of Engineering and Applied Science May 5th, 2005 Nirav Patel Voronoi

1.01k views • 71 slides
Anisotropic Voronoi diagrams and Delaunay Meshes Mariette Yvinec INRIA Sophia Antipolis

Anisotropic Voronoi diagrams and Delaunay Meshes Mariette Yvinec INRIA Sophia Antipolis

Anisotropic Voronoi diagrams and Delaunay Meshes Mariette Yvinec INRIA Sophia Antipolis Geometric Computing Workshop Heraklion, January 2013 MY (INRIA Sophia Antipolis) Anisotropic Voronoi-Delaunay GC2013 1 / 49 Introduction Motivation and

1.4k views • 50 slides
Recognizing Straight Skeletons and Voronoi Diagrams and Reconstructing Their Input Therese Biedl 1

Recognizing Straight Skeletons and Voronoi Diagrams and Reconstructing Their Input Therese Biedl 1

Recognizing Straight Skeletons and Voronoi Diagrams and Reconstructing Their Input Therese Biedl 1 Martin Held 2 Stefan Huber 3 1 David R. Cheriton School of Computer Science University of Waterloo, Canada 2 FB Computerwissenschaften Universit

696 views • 58 slides
Recognizing Straight Skeletons and Voronoi Diagrams and Reconstructing Their Input Therese Biedl 1

Recognizing Straight Skeletons and Voronoi Diagrams and Reconstructing Their Input Therese Biedl 1

Recognizing Straight Skeletons and Voronoi Diagrams and Reconstructing Their Input Therese Biedl 1 Martin Held 2 Stefan Huber 3 1 David R. Cheriton School of Computer Science University of Waterloo, Canada 2 FB Computerwissenschaften Universit

831 views • 65 slides
Optimal parameterized algorithms for planar facility location problems using Voronoi diagrams and

Optimal parameterized algorithms for planar facility location problems using Voronoi diagrams and

Optimal parameterized algorithms for planar facility location problems using Voronoi diagrams and sphere cut decompositions Dniel Marx Institute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI) Budapest, Hungary

617 views • 60 slides
Voronoi Diagrams Fortunes Algorithm and Applications Kevin Wittmer Mentor: Rob Maschal DRP

Voronoi Diagrams Fortunes Algorithm and Applications Kevin Wittmer Mentor: Rob Maschal DRP

Voronoi Diagrams Fortunes Algorithm and Applications Kevin Wittmer Mentor: Rob Maschal DRP Summer 2016 Kevin Wittmer, Mentor: Rob Maschal Voronoi Diagrams DRP Summer 2016 1 / 15 Introduction What is Computational Geometry? The

413 views • 15 slides
http://localhost/movim_diapo_fosdem/ 1 sur 6 30/01/2016 10:57

http://localhost/movim_diapo_fosdem/ 1 sur 6 30/01/2016 10:57

http://localhost/movim_diapo_fosdem/ 1 sur 6 30/01/2016 10:57 http://localhost/movim_diapo_fosdem/ 2 sur 6 30/01/2016 10:57 http://localhost/movim_diapo_fosdem/ 3 sur 6 30/01/2016 10:57 http://localhost/movim_diapo_fosdem/ 4 sur 6

222 views • 6 slides
TWO-DIMENSIONAL GAUSS-LEGENDRE QUADRATURE: SEEMINGLY UNRELATED DISPERSION-FLEXIBLE COUNT

TWO-DIMENSIONAL GAUSS-LEGENDRE QUADRATURE: SEEMINGLY UNRELATED DISPERSION-FLEXIBLE COUNT

TWO-DIMENSIONAL GAUSS-LEGENDRE QUADRATURE: SEEMINGLY UNRELATED DISPERSION-FLEXIBLE COUNT REGRESSIONS by Joseph V. Terza and Abbie Zhang Department of Economics Indiana University School of Liberal Arts at IUPUI Indianapolis, IN 46202

635 views • 29 slides
Best Practices for Serving People With High Acuity Needs October 20, 2020 Housekeeping A

Best Practices for Serving People With High Acuity Needs October 20, 2020 Housekeeping A

Best Practices for Serving People With High Acuity Needs October 20, 2020 Housekeeping A recording of todays session, along with the slide deck and a copy of the Chat and Q&A content will be posted to the HUD Exchange within 2-3

430 views • 39 slides
Safety and sustainability in the chemical supply chain Craig Thomson | Associate Director

Safety and sustainability in the chemical supply chain Craig Thomson | Associate Director

Safety and sustainability in the chemical supply chain Craig Thomson | Associate Director the-ncec.com/emergencyresponse Agenda Four quadrants of emergency response Compliance How will Brexit affect your supply chain? Risk Management

631 views • 28 slides
Unmasking Pseudonymous Authors Koppel, Schler Bonchek-Dokow Sebastian Wilhelm 1 We have :

Unmasking Pseudonymous Authors Koppel, Schler Bonchek-Dokow Sebastian Wilhelm 1 We have :

Unmasking Pseudonymous Authors Koppel, Schler Bonchek-Dokow Sebastian Wilhelm 1 We have : examples ofthe writing of a single author Task : determine if given texts were or were not written by this author 2 We do not lack negative

203 views • 18 slides
Sur quelques probl` emes variationnels avec p enalisation dinterfaces Soutenance dHDR

Sur quelques probl` emes variationnels avec p enalisation dinterfaces Soutenance dHDR

Sur quelques probl` emes variationnels avec p enalisation dinterfaces Soutenance dHDR Michael Goldman CNRS, LJLL, Paris 7 17 d ecembre 2018 Introduction General problem: solve min E P ( E ) + G ( E ) with or without volume

830 views • 51 slides
Un solveur de syst` emes non lin eaires bas e sur le polytope de Bernstein Christoph F

Un solveur de syst` emes non lin eaires bas e sur le polytope de Bernstein Christoph F

Nonlinear Systems Solver based on a Bernstein Polytope Chr. F unfzig Un solveur de syst` emes non lin eaires bas e sur le polytope de Bernstein Christoph F unfzig Dominique Michelucci Sebti Foufou LE2I, Universit e de

514 views • 38 slides
Building Good Triangulations 1. Nets and thick triangulations 2. Triangulation of manifolds

Building Good Triangulations 1. Nets and thick triangulations 2. Triangulation of manifolds

Building Good Triangulations 1. Nets and thick triangulations 2. Triangulation of manifolds Jean-Daniel Boissonnat INRIA Hamilton Mathematics Institute 17-19 June, 2018 1 / 58 Triangulations A central subject since the early days of

1.38k views • 76 slides

More recommend