Papers
Topics
Authors
Recent
Search
2000 character limit reached

Ipelets for the Convex Polygonal Geometry

Published 15 Mar 2024 in cs.CG | (2403.10033v1)

Abstract: There are many structures, both classical and modern, involving convex polygonal geometries whose deeper understanding would be facilitated through interactive visualizations. The Ipe extensible drawing editor, developed by Otfried Cheong, is a widely used software system for generating geometric figures. One of its features is the capability to extend its functionality through programs called Ipelets. In this media submission, we showcase a collection of new Ipelets that construct a variety of geometric objects based on polygonal geometries. These include Macbeath regions, metric balls in the forward and reverse Funk distance, metric balls in the Hilbert metric, polar bodies, the minimum enclosing ball of a point set, and minimum spanning trees in both the Funk and Hilbert metrics. We also include a number of utilities on convex polygons, including union, intersection, subtraction, and Minkowski sum (previously implemented as a CGAL Ipelet). All of our Ipelets are programmed in Lua and are freely available.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (57)
  1. Economical Delone sets for approximating convex bodies. In Proc. 16th Scand. Workshop Algorithm Theory, pages 4:1–4:12, 2018.
  2. Smooth distance approximation. In 31st Annual European Symposium on Algorithms (ESA 2023). Schloss-Dagstuhl-Leibniz Zentrum für Informatik, 2023.
  3. Optimal bound on the combinatorial complexity of approximating polytopes. ACM Transactions on Algorithms, 18(4):1–29, 2022.
  4. Optimal area-sensitive bounds for polytope approximation. In Proceedings of the twenty-eighth annual symposium on Computational geometry, pages 363–372, 2012.
  5. Optimal approximate polytope membership. In Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 270–288. SIAM, 2017.
  6. Economical convex coverings and applications. In Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1834–1861. SIAM, 2023.
  7. The effect of corners on the complexity of approximate range searching. In Proceedings of the twenty-second annual symposium on Computational geometry, pages 11–20, 2006.
  8. Random polytopes, convex bodies, and approximation. Stochastic Geometry: Lectures given at the CIME Summer School held in Martina Franca, Italy, September 13–18, 2004, pages 77–118, 2007.
  9. Convex bodies, economic cap coverings, random polytopes. Mathematika, 35(2):274–291, 1988.
  10. Thomas Bläsius. poincare. 2021-03-31. URL: https://github.com/thobl/ipelets.
  11. Minimum spanning tree analysis of brain networks: A systematic review of network size effects, sensitivity for neuropsychiatric pathology, and disorder specificity. Network Neuroscience, 6(2):301–319, 2022.
  12. Evolutionary diversity optimization and the minimum spanning tree problem. In Proceedings of the Genetic and Evolutionary Computation Conference, pages 198–206, 2021.
  13. Marian Brändle. Copy tools Ipelet. URL: https://github.com/Marian-Braendle/ipe-copytools.
  14. How hard is halfspace range searching? In Proceedings of the eighth annual symposium on Computational geometry, pages 271–275, 1992.
  15. Software and analysis for dynamic Voronoi diagrams in the Hilbert metric. arXiv preprint arXiv:2304.02745, 2023.
  16. Support vector machine classification for large data sets via minimum enclosing ball clustering. Neurocomputing, 71(4-6):611–619, 2008.
  17. Twenty-four-hour ahead probabilistic global horizontal irradiance forecasting using gaussian process regression. Algorithms, 14(6):177, 2021.
  18. Otfried Cheong. The IPE extensible drawing editor. Version 7.2.28, 2024-03-12. URL: https://ipe.otfried.org/.
  19. Hilbert geometry for convex polygonal domains. J. Geom., 100(1-2):37–64, 2011. doi:10.1007/s00022-011-0066-2.
  20. Computational Geometry: Algorithms and Applications. Springer, 3rd edition, 2010.
  21. Symplectic polar duality, quantum blobs, and generalized Gaussians. Symmetry, 14(9):1890, 2022.
  22. Pointillisme à la signac and construction of a quantum fiber bundle over convex bodies. Foundations of Physics, 53(2):43, 2023.
  23. Symplectic and Lagrangian polar duality; Applications to quantum information geometry. arXiv preprint arXiv:2309.07775, 2023.
  24. Maurice A De Gosson. Polar duality between pairs of transversal Lagrangian planes. Applications to uncertainty principles. Bulletin des Sciences Mathématiques, 179:103171, 2022.
  25. CGAL Ipelets. In CGAL User and Reference Manual. CGAL Editorial Board, 5.6.1 edition, 2024. URL: https://doc.cgal.org/5.6.1/Manual/packages.html#PkgCGALIpelets.
  26. Convex polyhedral meshing for robust solid modeling. ACM Transactions on Graphics (TOG), 40(6):1–16, 2021.
  27. Dmitry Faifman. A Funk perspective on billiards, projective geometry and Mahler volume. arXiv preprint arXiv:2012.12159, 2020.
  28. A distributed algorithm for directed minimum-weight spanning tree. Distributed Computing, 36(1):57–87, 2023.
  29. Koji Fujiwara. Geometry of the Funk metric on Weil-Petersson spaces. Math. Zeitschrift, 274(1-2):647–665, 2013.
  30. Clustering with minimum spanning trees: How good can it be? arXiv preprint arXiv:2303.05679, 2023.
  31. Delaunay triangulations in the Hilbert metric. arXiv preprint arXiv:2312.05987, 2023.
  32. Voronoi diagrams in the Hilbert metric. In 39th International Symposium on Computational Geometry (SoCG 2023). Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2023.
  33. On self-circumferences in Minkowski planes. Extracta Mathematicae, 34:19–28, 2019. doi:10.17398/2605-5686.34.1.19.
  34. Closed-form Minkowski sum approximations for efficient optimization-based collision avoidance. In 2022 American Control Conference (ACC), pages 3857–3864. IEEE, 2022.
  35. Minimum spanning tree hierarchical clustering algorithm: A new pythagorean fuzzy similarity measure for the analysis of functional brain networks. Expert Systems with Applications, 201:117016, 2022.
  36. Maximum-clearance planar motion planning based on recent developments in computing Minkowski sums and Voronoi diagrams. In Pacific Graphics Short Papers, Posters, and Work-in-Progress Papers, 2021. doi:10.2312/pg.20211382.
  37. Minimum spanning tree based graph neural network for emotion classification using EEG. Neural Networks, 145:308–318, 2022.
  38. A. M. Macbeath. A theorem on non-homogeneous lattices. Annals of Mathematics, 56(2):269–293, 1952. URL: http://www.jstor.org/stable/1969800.
  39. Andrew Martchenko. pollyfillet. 2019-02-26. URL: https://github.com/AndrewMartchenko/my-ipelets/tree/master/polyfillet.
  40. Andrew Martchenko. tangentlines. 2019-02-26. URL: https://github.com/AndrewMartchenko/my-ipelets/tree/master/tangentlines.
  41. Fine approximation of convex bodies by polytopes. American Journal of Mathematics, 142(3):809–820, 2020.
  42. On balls in a Hilbert polygonal geometry (multimedia contribution). In Proc. 33rd Internat. Sympos. Comput. Geom., volume 77 of Leibniz International Proceedings in Informatics (LIPIcs), pages 67:1–67:4. Schloss Dagstuhl–Leibniz-Zentrum für Informatik, 2017. doi:10.4230/LIPIcs.SoCG.2017.67.
  43. Frank Nielsen and Ke Sun. Clustering in Hilbert’s projective geometry: The case studies of the probability simplex and the elliptope of correlation matrices. In Frank Nielsen, editor, Geometric Structures of Information, pages 297–331. Springer Internat. Pub., 2019. doi:10.1007/978-3-030-02520-5_11.
  44. Frank Nielsen and Ke Sun. Non-linear embeddings in Hilbert simplex geometry. In Topological, Algebraic and Geometric Learning Workshops 2023, pages 254–266. PMLR, 2023.
  45. From Funk to Hilbert geometry. In Handbook of Hilbert geometry, volume 22 of IRMA Lectures in Mathematics and Theoretical Physics, pages 33–68. European Mathematical Society Publishing House, 2014. doi:10.4171/147-1/2.
  46. Timelike Hilbert and Funk geometries. Differential Geometry and its Applications, 67:101554, 2019.
  47. Lluís Alemany Puig. Embedding visualizer for IPE. 2022-01-29. URL: https://github.com/lluisalemanypuig/ipe.embedviz.
  48. Günter Rote. Free-space diagram. Version 2, 2010-07-15. URL: https://www.mi.fu-berlin.de/inf/groups/ag-ti/software/ipelets.html.
  49. Efficient exact collision detection between ellipsoids and superquadrics via closed-form Minkowski sums. In 2019 International Conference on Robotics and Automation (ICRA), pages 1765–1771. IEEE, 2019.
  50. Hassan Sadeghi. Funk-type Finsler metrics. Journal of Finsler Geometry and its Applications, 2(2):77–88, 2021.
  51. Sound and robust solid modeling via exact real arithmetic and continuity. Proceedings of the ACM on Programming Languages, 3(ICFP):1–29, 2019.
  52. Constantin Vernicos. On the Hilbert geometry of convex polytopes. In Handbook of Hilbert geometry, volume 22 of IRMA Lectures in Mathematics and Theoretical Physics, pages 111–126. European Mathematical Society Publishing House, 2014. doi:10.48550/arXiv.1406.0733.
  53. Flag-approximability of convex bodies and volume growth of Hilbert geometries. In Annales Scientifiques de l’École Normale Supérieure, volume 54, pages 1297–1315, 2021.
  54. A novel Minkowski sum contact algorithm for arbitrarily shaped particles constructed by multiple dilated dem models. International Journal of Solids and Structures, 280:112409, 2023.
  55. The distance between convex sets with Minkowski sum structure: Application to collision detection. Computational Optimization and Applications, 77:465–490, 2020.
  56. On a new class of Finsler metrics. Differential Geometry and its Applications, 29(2):244–254, 2011.
  57. A scaling-free minimum enclosing ball method to detect differentially expressed genes for RNA-seq data. BMC genomics, 22(1):1–14, 2021.

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Collections

Sign up for free to add this paper to one or more collections.

Sign Up

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.

Sign Up for Free