Computing a minimum-weight perfect matching for a point set $P$ in Euclidean space is a classic geometric optimization problem. We consider the problem in a dynamic setting, where pairs of points may be added to or removed from the set $P$. Our focus is on maintaining an approximately optimal solution without making too many changes to the solution.
Is this you? As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work.
Claim your profile
Articles by de Berg
Computer Science > Computational Geometry
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Computer Science > Computational Geometry
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Computer Science > Computational Geometry
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
[2602.16518] Improved Bounds for Discrete Voronoi Games
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
[2511.02960] The Contiguous Art Gallery Problem is in Θ(n log n)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
[2507.13026] The Price of Diversity of the Traveling Salesman Problem
|
By de Berg, Andres Lopez Verified, Andrés López Verified, Andres Martinez Verified, Andrés Martínez Verified, Frits Spieksma
|
arXiv
[2504.02369] Finding Diverse Solutions in Combinatorial Problems with a Distributive Lattice Structure
|
By de Berg, Andres Lopez Verified, Andrés López Verified, Andres Martinez Verified, Andrés Martínez Verified, Frits Spieksma
|
arXiv
[2503.03435] Nearest Neighbor Searching in a Dynamic Simple Polygon
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
[2402.12110] The Complexity of Geodesic Spanners using Steiner Points
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
[2401.01289] Competitive Searching over Terrains
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
[2312.08803] Clustering with Few Disks to Minimize the Sum of Radii
[Submitted on 14 Dec 2023 ( v1 ), last revised 12 Sep 2024 (this version, v2)] Title:Clustering with Few Disks to Minimize the Sum of Radii View a PDF of the paper titled Clustering with Few Disks to Minimize the Sum of Radii, by Mikkel Abrahamsen and 4 other authors View PDF HTML (experimental) Abstract:Given a set of $n$ points in the Euclidean plane, the $k$-MinSumRadius problem asks to cover this point set using $k$ disks with the objective of minimizing the sum of the radii of the disks.
An ETH-Tight Exact Algorithm for Euclidean TSP
We study exact algorithms for Metric TSP in ℝd. In the early 1990s, algorithms with (Formula Presented) running time were presented for the planar case, and some years later an algorithm with (Formula Presnted) running time was presented for any d\geqslant 2. Despite significant interest in subexponential exact algorithms over the past decade, there has been no progress on Metric TSP, except for a lower bound stating that the problem admits no (Formula Presented) algorithm unless ETH fails.
[2303.00666] Towards Space Efficient Two-Point Shortest Path Queries in a Polygonal Domain
[Submitted on 1 Mar 2023 ( v1 ), last revised 21 Feb 2024 (this version, v3)] Title:Towards Space Efficient Two-Point Shortest Path Queries in a Polygonal Domain Download a PDF of the paper titled Towards Space Efficient Two-Point Shortest Path Queries in a Polygonal Domain, by Sarita de Berg and 2 other authors Download PDF HTML (experimental) Abstract:We devise a data structure that can answer shortest path queries for two query points in a polygonal domain $P$ on $n$ vertices.
[2303.07290] Finding Diverse Minimum s-t Cuts
|
By de Berg, Andres Lopez Verified, Andrés López Verified, Andres Martinez Verified, Andrés Martínez Verified, Frits Spieksma
|
arXiv
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
[2204.01772] Partitioning axis-parallel lines in 3D
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
[2003.09948] Euclidean TSP in Narrow Strips
[Submitted on 22 Mar 2020 ( v1 ), last revised 5 Apr 2024 (this version, v2)] Title:Euclidean TSP in Narrow Strips View a PDF of the paper titled Euclidean TSP in Narrow Strips, by Henk Alkema and Mark de Berg and Remco van der Hofstad and S\'andor Kisfaludi-Bak View PDF HTML (experimental) Abstract:We investigate how the complexity of Euclidean TSP for point sets $P$ inside the strip $(-\infty,+\infty)\times [0,\delta]$ depends on the strip width $\delta$. We obtain two main results.
Computational geometry
Title Computational geometry : algorithms and applications Edition 2nd ed Author(s) de Berg, Mark ; van Kreveld, Marc ; Overmars, Mark ; Schwarzkopf, Otfried Publication Berlin : Springer, 2008. - 365 p. Subject code 519.6 ; 514 Subject category Mathematical Physics and Mathematics Abstract Computational geometry emerged from the field of algorithms design and anal ysis in the late 1970s.
Show More
loading
Actions
Is this you?
As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work.Get in touch with de
Contact de, search articles and posts on X, monitor coverage, and track replies from one place.
Learn more about Muck Rack