J. A. Bærentzen, Rasmus Emil Christensen, Emil Toftegaard Gæde, E. Rotenberg
{"title":"Multilevel Skeletonization Using Local Separators","authors":"J. A. Bærentzen, Rasmus Emil Christensen, Emil Toftegaard Gæde, E. Rotenberg","doi":"10.48550/arXiv.2303.07210","DOIUrl":"https://doi.org/10.48550/arXiv.2303.07210","url":null,"abstract":"In this paper we give a new, efficient algorithm for computing curve skeletons, based on local separators. Our efficiency stems from a multilevel approach, where we solve small problems across levels of detail and combine these in order to quickly obtain a skeleton. We do this in a highly modular fashion, ensuring complete flexibility in adapting the algorithm for specific types of input or for otherwise targeting specific applications. Separator based skeletonization was first proposed by B{ae}rentzen and Rotenberg in [ACM Tran. Graphics'21], showing high quality output at the cost of running times which become prohibitive for large inputs. Our new approach retains the high quality output, and applicability to any spatially embedded graph, while being orders of magnitude faster for all practical purposes. We test our skeletonization algorithm for efficiency and quality in practice, comparing it to local separator skeletonization on the University of Groningen Skeletonization Benchmark [Telea'16].","PeriodicalId":413611,"journal":{"name":"International Symposium on Computational Geometry","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123916079","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"The Localized Union-of-Balls Bifiltration","authors":"Michael Kerber, Matthias Söls","doi":"10.48550/arXiv.2303.07002","DOIUrl":"https://doi.org/10.48550/arXiv.2303.07002","url":null,"abstract":"We propose an extension of the classical union-of-balls filtration of persistent homology: fixing a point $q$, we focus our attention to a ball centered at $q$ whose radius is controlled by a second scale parameter. We discuss an absolute variant, where the union is just restricted to the $q$-ball, and a relative variant where the homology of the $q$-ball relative to its boundary is considered. Interestingly, these natural constructions lead to bifiltered simplicial complexes which are not $k$-critical for any finite $k$. Nevertheless, we demonstrate that these bifiltrations can be computed exactly and efficiently, and we provide a prototypical implementation using the CGAL library. We also argue that some of the recent algorithmic advances for $2$-parameter persistence (which usually assume $k$-criticality for some finite $k$) carry over to the $infty$-critical case.","PeriodicalId":413611,"journal":{"name":"International Symposium on Computational Geometry","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133728970","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Polynomial-Time Approximation Schemes for Independent Packing Problems on Fractionally Tree-Independence-Number-Fragile Graphs","authors":"Esther Galby, Andrea Munaro, Shizhou Yang","doi":"10.48550/arXiv.2303.07444","DOIUrl":"https://doi.org/10.48550/arXiv.2303.07444","url":null,"abstract":"We investigate a relaxation of the notion of treewidth-fragility, namely tree-independence-number-fragility. In particular, we obtain polynomial-time approximation schemes for independent packing problems on fractionally tree-independence-number-fragile graph classes. Our approach unifies and extends several known polynomial-time approximation schemes on seemingly unrelated graph classes, such as classes of intersection graphs of fat objects in a fixed dimension or proper minor-closed classes. We also study the related notion of layered tree-independence number, a relaxation of layered treewidth.","PeriodicalId":413611,"journal":{"name":"International Symposium on Computational Geometry","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130187395","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Decomposition of zero-dimensional persistence modules via rooted subsets","authors":"Á. Alonso, Michael Kerber","doi":"10.48550/arXiv.2303.06118","DOIUrl":"https://doi.org/10.48550/arXiv.2303.06118","url":null,"abstract":"We study the decomposition of zero-dimensional persistence modules, viewed as functors valued in the category of vector spaces factorizing through sets. Instead of working directly at the level of vector spaces, we take a step back and first study the decomposition problem at the level of sets. This approach allows us to define the combinatorial notion of rooted subsets. In the case of a filtered metric space $M$, rooted subsets relate the clustering behavior of the points of $M$ with the decomposition of the associated persistence module. In particular, we can identify intervals in such a decomposition quickly. In addition, rooted subsets can be understood as a generalization of the elder rule, and are also related to the notion of constant conqueror of Cai, Kim, M'emoli and Wang. As an application, we give a lower bound on the number of intervals that we can expect in the decomposition of zero-dimensional persistence modules of a density-Rips filtration in Euclidean space: in the limit, and under very general circumstances, we can expect that at least 25% of the indecomposable summands are interval modules.","PeriodicalId":413611,"journal":{"name":"International Symposium on Computational Geometry","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121953757","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An extension theorem for signotopes","authors":"H. Bergold, S. Felsner, M. Scheucher","doi":"10.48550/arXiv.2303.04079","DOIUrl":"https://doi.org/10.48550/arXiv.2303.04079","url":null,"abstract":"In 1926, Levi showed that, for every pseudoline arrangement $mathcal{A}$ and two points in the plane, $mathcal{A}$ can be extended by a pseudoline which contains the two prescribed points. Later extendability was studied for arrangements of pseudohyperplanes in higher dimensions. While the extendability of an arrangement of proper hyperplanes in $mathbb{R}^d$ with a hyperplane containing $d$ prescribed points is trivial, Richter-Gebert found an arrangement of pseudoplanes in $mathbb{R}^3$ which cannot be extended with a pseudoplane containing two particular prescribed points. In this article, we investigate the extendability of signotopes, which are a combinatorial structure encoding a rich subclass of pseudohyperplane arrangements. Our main result is that signotopes of odd rank are extendable in the sense that for two prescribed crossing points we can add an element containing them. Moreover, we conjecture that in all even ranks $r geq 4$ there exist signotopes which are not extendable for two prescribed points. Our conjecture is supported by examples in ranks 4, 6, 8, 10, and 12 that were found with a SAT based approach.","PeriodicalId":413611,"journal":{"name":"International Symposium on Computational Geometry","volume":"148 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132348907","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"The Complexity of Geodesic Spanners","authors":"Sarita de Berg, M. V. Kreveld, F. Staals","doi":"10.48550/arXiv.2303.02997","DOIUrl":"https://doi.org/10.48550/arXiv.2303.02997","url":null,"abstract":"A geometric $t$-spanner for a set $S$ of $n$ point sites is an edge-weighted graph for which the (weighted) distance between any two sites $p,q in S$ is at most $t$ times the original distance between $p$ and $q$. We study geometric $t$-spanners for point sets in a constrained two-dimensional environment $P$. In such cases, the edges of the spanner may have non-constant complexity. Hence, we introduce a novel spanner property: the spanner complexity, that is, the total complexity of all edges in the spanner. Let $S$ be a set of $n$ point sites in a simple polygon $P$ with $m$ vertices. We present an algorithm to construct, for any constant $varepsilon>0$ and fixed integer $k geq 1$, a $(2k + varepsilon)$-spanner with complexity $O(mn^{1/k} + nlog^2 n)$ in $O(nlog^2n + mlog n + K)$ time, where $K$ denotes the output complexity. When we consider sites in a polygonal domain $P$ with holes, we can construct such a $(2k+varepsilon)$-spanner of similar complexity in $O(n^2 log m + nmlog m + K)$ time. Additionally, for any constant $varepsilon in (0,1)$ and integer constant $t geq 2$, we show a lower bound for the complexity of any $(t-varepsilon)$-spanner of $Omega(mn^{1/(t-1)} + n)$.","PeriodicalId":413611,"journal":{"name":"International Symposium on Computational Geometry","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123961824","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
S. Felsner, Hendrik Schrezenmaier, Felix Schröder, R. Steiner
{"title":"Linear Size Universal Point Sets for Classes of Planar Graphs","authors":"S. Felsner, Hendrik Schrezenmaier, Felix Schröder, R. Steiner","doi":"10.48550/arXiv.2303.00109","DOIUrl":"https://doi.org/10.48550/arXiv.2303.00109","url":null,"abstract":"A finite set $P$ of points in the plane is $n$-universal with respect to a class $mathcal{C}$ of planar graphs if every $n$-vertex graph in $mathcal{C}$ admits a crossing-free straight-line drawing with vertices at points of $P$. For the class of all planar graphs the best known upper bound on the size of a universal point set is quadratic and the best known lower bound is linear in $n$. Some classes of planar graphs are known to admit universal point sets of near linear size, however, there are no truly linear bounds for interesting classes beyond outerplanar graphs. In this paper, we show that there is a universal point set of size $2n-2$ for the class of bipartite planar graphs with $n$ vertices. The same point set is also universal for the class of $n$-vertex planar graphs of maximum degree $3$. The point set used for the results is what we call an exploding double chain, and we prove that this point set allows planar straight-line embeddings of many more planar graphs, namely of all subgraphs of planar graphs admitting a one-sided Hamiltonian cycle. The result for bipartite graphs also implies that every $n$-vertex plane graph has a $1$-bend drawing all whose bends and vertices are contained in a specific point set of size $4n-6$, this improves a bound of $6n-10$ for the same problem by L\"offler and T'oth.","PeriodicalId":413611,"journal":{"name":"International Symposium on Computational Geometry","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130179078","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Lower Bounds for Intersection Reporting among Flat Objects","authors":"P. Afshani, P. Cheng","doi":"10.48550/arXiv.2302.11433","DOIUrl":"https://doi.org/10.48550/arXiv.2302.11433","url":null,"abstract":"Recently, Ezra and Sharir [ES22a] showed an $O(n^{3/2+sigma})$ space and $O(n^{1/2+sigma})$ query time data structure for ray shooting among triangles in $mathbb{R}^3$. This improves the upper bound given by the classical $S(n)Q(n)^4=O(n^{4+sigma})$ space-time tradeoff for the first time in almost 25 years and in fact lies on the tradeoff curve of $S(n)Q(n)^3=O(n^{3+sigma})$. However, it seems difficult to apply their techniques beyond this specific space and time combination. This pheonomenon appears persistently in almost all recent advances of flat object intersection searching, e.g., line-tetrahedron intersection in $mathbb{R}^4$ [ES22b], triangle-triangle intersection in $mathbb{R}^4$ [ES22b], or even among flat semialgebraic objects [AAEKS22]. We give a timely explanation to this phenomenon from a lower bound perspective. We prove that given a set $mathcal{S}$ of $(d-1)$-dimensional simplicies in $mathbb{R}^d$, any data structure that can report all intersections with small ($n^{o(1)}$) query time must use $Omega(n^{2(d-1)-o(1)})$ space. This dashes the hope of any significant improvement to the tradeoff curves for small query time and almost matches the classical upper bound. We also obtain an almost matching space lower bound of $Omega(n^{6-o(1)})$ for triangle-triangle intersection reporting in $mathbb{R}^4$ when the query time is small. Along the way, we further develop the previous lower bound techniques by Afshani and Cheng [AC21, AC22].","PeriodicalId":413611,"journal":{"name":"International Symposium on Computational Geometry","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-02-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130960591","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
S. Bhore, R. Ganian, Liana Khazaliya, Fabrizio Montecchiani, M. Nöllenburg
{"title":"Extending Orthogonal Planar Graph Drawings is Fixed-Parameter Tractable","authors":"S. Bhore, R. Ganian, Liana Khazaliya, Fabrizio Montecchiani, M. Nöllenburg","doi":"10.48550/arXiv.2302.10046","DOIUrl":"https://doi.org/10.48550/arXiv.2302.10046","url":null,"abstract":"The task of finding an extension to a given partial drawing of a graph while adhering to constraints on the representation has been extensively studied in the literature, with well-known results providing efficient algorithms for fundamental representations such as planar and beyond-planar topological drawings. In this paper, we consider the extension problem for bend-minimal orthogonal drawings of planar connected graphs, which is among the most fundamental geometric graph drawing representations. While the problem was known to be NP-hard, it is natural to consider the case where only a small part of the graph is still to be drawn. Here, we establish the fixed-parameter tractability of the problem when parameterized by the size of the missing subgraph. Our algorithm is based on multiple novel ingredients which intertwine geometric and combinatorial arguments. These include the identification of a new graph representation of bend-equivalent regions for vertex placement in the plane, establishing a bound on the treewidth of this auxiliary graph, and a global point-grid that allows us to discretize the possible placement of bends and vertices into locally bounded subgrids for each of the above regions.","PeriodicalId":413611,"journal":{"name":"International Symposium on Computational Geometry","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129972304","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Combinatorial Depth Measures for Hyperplane Arrangements","authors":"P. Schnider, Pablo Sober'on","doi":"10.48550/arXiv.2302.07768","DOIUrl":"https://doi.org/10.48550/arXiv.2302.07768","url":null,"abstract":"Regression depth, introduced by Rousseeuw and Hubert in 1999, is a notion that measures how good of a regression hyperplane a given query hyperplane is with respect to a set of data points. Under projective duality, this can be interpreted as a depth measure for query points with respect to an arrangement of data hyperplanes. The study of depth measures for query points with respect to a set of data points has a long history, and many such depth measures have natural counterparts in the setting of hyperplane arrangements. For example, regression depth is the counterpart of Tukey depth. Motivated by this, we study general families of depth measures for hyperplane arrangements and show that all of them must have a deep point. Along the way we prove a Tverberg-type theorem for hyperplane arrangements, giving a positive answer to a conjecture by Rousseeuw and Hubert from 1999. We also get three new proofs of the centerpoint theorem for regression depth, all of which are either stronger or more general than the original proof by Amenta, Bern, Eppstein, and Teng. Finally, we prove a version of the center transversal theorem for regression depth.","PeriodicalId":413611,"journal":{"name":"International Symposium on Computational Geometry","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-02-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128936846","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}