Intersection Searching Amid Tetrahedra in 4-Space and Efficient Continuous Collision Detection (English)
Free access
- New search for: Ezra, Esther
- Further information on Ezra, Esther:
- https://orcid.org/0000-0001-8133-1335
- New search for: Sharir, Micha
- Further information on Sharir, Micha:
- https://orcid.org/0000-0002-2541-3763
- New search for: Ezra, Esther
- Further information on Ezra, Esther:
- https://orcid.org/0000-0001-8133-1335
- New search for: Sharir, Micha
- Further information on Sharir, Micha:
- https://orcid.org/0000-0002-2541-3763
- New search for: Chechik, Shiri
- New search for: Navarro, Gonzalo
- Further information on Navarro, Gonzalo:
- https://orcid.org/0000-0002-2286-741X
- New search for: Rotenberg, Eva
- Further information on Rotenberg, Eva:
- https://orcid.org/0000-0001-5853-7909
- New search for: Herman, Grzegorz
- Further information on Herman, Grzegorz:
- https://orcid.org/0000-0001-6855-8316
In:
LIPIcs, Volume 244, ESA 2022
: 30th Annual European Symposium on Algorithms (ESA 2022)
;
244
;
51:1-51:17
;
2022
-
ISBN:
-
ISSN:
- Conference paper / Electronic Resource
-
Title:Intersection Searching Amid Tetrahedra in 4-Space and Efficient Continuous Collision Detection
-
Contributors:Ezra, Esther ( author ) / Sharir, Micha ( author ) / Chechik, Shiri ( editor ) / Navarro, Gonzalo ( editor ) / Rotenberg, Eva ( editor ) / Herman, Grzegorz ( editor )
-
Published in:LIPIcs, Volume 244, ESA 2022 : 30th Annual European Symposium on Algorithms (ESA 2022) ; 244 ; 51:1-51:17Leibniz International Proceedings in Informatics (LIPIcs) ; 244 ; 51:1-51:17
-
Publisher:
- New search for: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
-
Publication date:2022-09-01
-
Size:17 pages , 778662 byte
-
Remarks:LIPIcs, Vol. 244, 30th Annual European Symposium on Algorithms (ESA 2022), pages 51:1-51:17
-
ISBN:
-
ISSN:
-
DOI:
-
Type of media:Conference paper
-
Type of material:Electronic Resource
-
Language:English
-
Keywords:
-
Licence:
-
Source:
Table of contents conference proceedings
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 1
-
Enumerating Minimal Connected Dominating SetsAbu-Khzam, Faisal N. / Fernau, Henning / Gras, Benjamin / Liedloff, Mathieu / Mann, Kevin et al. | 2022
- 2
-
Non-Adaptive Edge Counting and Sampling via Bipartite Independent Set QueriesAddanki, Raghavendra / McGregor, Andrew / Musco, Cameron et al. | 2022
- 3
-
Hardness of Token Swapping on TreesAichholzer, Oswin / Demaine, Erik D. / Korman, Matias / Lubiw, Anna / Lynch, Jayson / Masárová, Zuzana / Rudoy, Mikhail / Vassilevska Williams, Virginia / Wein, Nicole et al. | 2022
- 4
-
Tight Bounds for Online Matching in Bounded-Degree Graphs with Vertex CapacitiesAlbers, Susanne / Schubert, Sebastian et al. | 2022
- 5
-
TSP in a Simple PolygonAlkema, Henk / de Berg, Mark / Monemizadeh, Morteza / Theocharous, Leonidas et al. | 2022
- 6
-
Classical and Quantum Algorithms for Variants of Subset-Sum via Dynamic ProgrammingAllcock, Jonathan / Hamoudi, Yassine / Joux, Antoine / Klingelhöfer, Felix / Santha, Miklos et al. | 2022
- 7
-
Techniques for Generalized Colorful k-Center ProblemsAnegg, Georg / Vargas Koch, Laura / Zenklusen, Rico et al. | 2022
- 8
-
Simple Streaming Algorithms for Edge ColoringAnsari, Mohammad / Saneian, Mohammad / Zarrabi-Zadeh, Hamid et al. | 2022
- 9
-
Computing Smallest Convex Intersecting PolygonsAntoniadis, Antonios / de Berg, Mark / Kisfaludi-Bak, Sándor / Skarlatos, Antonis et al. | 2022
- 10
-
The Price of Hierarchical ClusteringArutyunova, Anna / Röglin, Heiko et al. | 2022
- 11
-
Bounding and Computing Obstacle Numbers of GraphsBalko, Martin / Chaplick, Steven / Ganian, Robert / Gupta, Siddharth / Hoffmann, Michael / Valtr, Pavel / Wolff, Alexander et al. | 2022
- 12
-
Computing NP-Hard Repetitiveness Measures via MAX-SATBannai, Hideo / Goto, Keisuke / Ishihata, Masakazu / Kanda, Shunsuke / Köppl, Dominik / Nishimoto, Takaaki et al. | 2022
- 13
-
Online Metric Allocation and Time-Varying RegularizationBansal, Nikhil / Coester, Christian et al. | 2022
- 14
-
An Upper Bound on the Number of Extreme Shortest Paths in Arbitrary DimensionsBarth, Florian / Funke, Stefan / Proissl, Claudius et al. | 2022
- 15
-
Galactic Token SlidingBartier, Valentin / Bousquet, Nicolas / Mouawad, Amer E. et al. | 2022
- 16
-
When Are Cache-Oblivious Algorithms Cache Adaptive? A Case Study of Matrix Multiplication and SortingBhattacharya, Arghya / Chowdhury, Abiyaz / Xu, Helen / Das, Rathish / Chowdhury, Rezaul A. / Johnson, Rob / Nithyanand, Rishab / Bender, Michael A. et al. | 2022
- 17
-
Simple Dynamic Spanners with Near-Optimal Recourse Against an Adaptive AdversaryBhattacharya, Sayan / Saranurak, Thatchaphol / Sukprasert, Pattara et al. | 2022
- 18
-
Online Spanners in Metric SpacesBhore, Sujoy / Filtser, Arnold / Khodabandeh, Hadi / Tóth, Csaba D. et al. | 2022
- 19
-
Sparse Temporal Spanners with Low StretchBilò, Davide / D'Angelo, Gianlorenzo / Gualà, Luciano / Leucci, Stefano / Rossi, Mirko et al. | 2022
- 20
-
Resource Sharing Revisited: Local Weak Duality and Optimal ConvergenceBlankenburg, Daniel et al. | 2022
- 21
-
On the External Validity of Average-Case Analyses of Graph AlgorithmsBläsius, Thomas / Fischbeck, Philipp et al. | 2022
- 22
-
On Polynomial Kernels for Traveling Salesperson Problem and Its GeneralizationsBlažej, Václav / Choudhary, Pratibha / Knop, Dušan / Schierreich, Šimon / Suchý, Ondřej / Valla, Tomáš et al. | 2022
- 23
-
Maximizing Sums of Non-Monotone Submodular and Linear Functions: Understanding the Unconstrained CaseBodek, Kobi / Feldman, Moran et al. | 2022
- 24
-
List Colouring Trees in Logarithmic SpaceBodlaender, Hans L. / Groenland, Carla / Jacob, Hugo et al. | 2022
- 25
-
Dynamic Coloring of Unit Interval Graphs with Limited Recourse BudgetBosek, Bartłomiej / Zych-Pawlewicz, Anna et al. | 2022
- 26
-
Polynomial Kernel for Immersion Hitting in TournamentsBożyk, Łukasz / Pilipczuk, Michał et al. | 2022
- 27
-
A Systematic Study of Isomorphism Invariants of Finite Groups via the Weisfeiler-Leman DimensionBrachter, Jendrik / Schweitzer, Pascal et al. | 2022
- 28
-
Faster Approximate Covering of Subcurves Under the Fréchet DistanceBrüning, Frederik / Conradi, Jacobus / Driemel, Anne et al. | 2022
- 29
-
Efficient Fréchet Distance Queries for SegmentsBuchin, Maike / van der Hoog, Ivor / Ophelders, Tim / Schlipf, Lena / Silveira, Rodrigo I. / Staals, Frank et al. | 2022
- 30
-
Search-Space Reduction via Essential VerticesBumpus, Benjamin Merlin / Jansen, Bart M. P. / de Kroon, Jari J. H. et al. | 2022
- 31
-
Width Helps and Hinders Splitting FlowsCáceres, Manuel / Cairo, Massimo / Grigorjew, Andreas / Khan, Shahbaz / Mumey, Brendan / Rizzi, Romeo / Tomescu, Alexandru I. / Williams, Lucia et al. | 2022
- 32
-
Counting Simplices in Hypergraph StreamsChakrabarti, Amit / Haris, Themistoklis et al. | 2022
- 33
-
Approximation Algorithms for Continuous Clustering and Facility Location ProblemsChakrabarty, Deeparnab / Negahbani, Maryam / Sarkar, Ankita et al. | 2022
- 34
-
Distinct Elements in Streams: An Algorithm for the (Text) BookChakraborty, Sourav / Vinodchandran¹, N. V. / Meel, Kuldeep S. et al. | 2022
- 35
-
Approximate Circular Pattern MatchingCharalampopoulos, Panagiotis / Kociumaka, Tomasz / Radoszewski, Jakub / Pissis, Solon P. / Rytter, Wojciech / Waleń, Tomasz / Zuba, Wiktor et al. | 2022
- 36
-
Multi-Dimensional Stable Roommates in 2-Dimensional Euclidean SpaceChen, Jiehua / Roy, Sanjukta et al. | 2022
- 37
-
Spanner Approximations in PracticeChimani, Markus / Stutzenstein, Finn et al. | 2022
- 38
-
Determinants from HomomorphismsCurticapean, Radu et al. | 2022
- 39
-
Conditional Lower Bounds for Dynamic Geometric Measure ProblemsDallant, Justin / Iacono, John et al. | 2022
- 40
-
A Simpler QPTAS for Scheduling Jobs with Precedence ConstraintsDas, Syamantak / Wiese, Andreas et al. | 2022
- 41
-
A Polynomial-Time Algorithm for 1/3-Approximate Nash Equilibria in Bimatrix GamesDeligkas, Argyrios / Fasoulakis, Michail / Markakis, Evangelos et al. | 2022
- 42
-
Near Optimal Algorithm for Fault Tolerant Distance Oracle and Single Source Replacement Path ProblemDey, Dipan / Gupta, Manoj et al. | 2022
- 43
-
Fast Computation of Zigzag PersistenceDey, Tamal K. / Hou, Tao et al. | 2022
- 44
-
Turbocharging Heuristics for Weak Coloring NumbersDobler, Alexander / Sorge, Manuel / Villedieu, Anaïs et al. | 2022
- 45
-
A Local Search Algorithm for Large Maximum Weight Independent Set ProblemsDong, Yuanyuan / Goldberg, Andrew V. / Noe, Alexander / Parotsidis, Nikos / Resende, Mauricio G.C. / Spaen, Quico et al. | 2022
- 46
-
SAT Backdoors: Depth Beats SizeDreier, Jan / Ordyniak, Sebastian / Szeider, Stefan et al. | 2022
- 47
-
Finding a Cluster in Incomplete DataEiben, Eduard / Ganian, Robert / Kanj, Iyad / Ordyniak, Sebastian / Szeider, Stefan et al. | 2022
- 48
-
Lyndon Arrays SimplifiedEllert, Jonas et al. | 2022
- 49
-
Learning-Augmented Query Policies for Minimum Spanning Tree with UncertaintyErlebach, Thomas / de Lima, Murilo Santos / Megow, Nicole / Schlöter, Jens et al. | 2022
- 50
-
Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local SearchEsmer, Barış Can / Kulik, Ariel / Marx, Dániel / Neuen, Daniel / Sharma, Roohani et al. | 2022
- 51
-
Intersection Searching Amid Tetrahedra in 4-Space and Efficient Continuous Collision DetectionEzra, Esther / Sharir, Micha et al. | 2022
- 52
-
Submodular Maximization Subject to Matroid Intersection on the FlyFeldman, Moran / Norouzi-Fard, Ashkan / Svensson, Ola / Zenklusen, Rico et al. | 2022
- 53
-
There and Back Again: On Applying Data Reduction Rules by Undoing OthersFigiel, Aleksander / Froese, Vincent / Nichterlein, André / Niedermeier, Rolf et al. | 2022
- 54
-
Improved Search of Relevant Points for Nearest-Neighbor ClassificationFlores-Velazco, Alejandro et al. | 2022
- 55
-
Longest Cycle Above Erdős-Gallai BoundFomin, Fedor V. / Golovach, Petr A. / Sagunov, Danil / Simonov, Kirill et al. | 2022
- 56
-
Improved Polynomial-Time Approximations for Clustering with Minimum Sum of Radii or DiametersFriggstad, Zachary / Jamshidian, Mahya et al. | 2022
- 57
-
Simple Worst-Case Optimal Adaptive Prefix-Free CodingGagie, Travis et al. | 2022
- 58
-
Taming Graphs with No Large Creatures and Skinny LaddersGajarský, Jakub / Jaffke, Lars / Lima, Paloma T. / Novotná, Jana / Pilipczuk, Marcin / Rzążewski, Paweł / Souza, Uéverton S. et al. | 2022
- 59
-
Faster Path Queries in Colored Trees via Sparse Matrix Multiplication and Min-Plus ProductGao, Younan / He, Meng et al. | 2022
- 60
-
Computing the 4-Edge-Connected Components of a Graph: An Experimental StudyGeorgiadis, Loukas / Italiano, Giuseppe F. / Kosinas, Evangelos et al. | 2022
- 61
-
Algorithmic Meta-Theorems for Combinatorial Reconfiguration RevisitedGima, Tatsuya / Ito, Takehiro / Kobayashi, Yasuaki / Otachi, Yota et al. | 2022
- 62
-
Efficient Recognition of Subgraphs of Planar Cubic Bridgeless GraphsGoetze, Miriam / Jungeblut, Paul / Ueckerdt, Torsten et al. | 2022
- 63
-
Adaptive-Adversary-Robust Algorithms via Small Copy Tree EmbeddingsHaepler, Bernhard / Hershkowitz, D. Ellis / Zuzic, Goran et al. | 2022
- 64
-
Hedonic Games and Treewidth RevisitedHanaka, Tesshu / Lampis, Michael et al. | 2022
- 65
-
Fine-Grained Complexity Lower Bounds for Families of Dynamic GraphsHenzinger, Monika / Paz, Ami / Sricharan, A. R. et al. | 2022
- 66
-
O(1) Steiner Point Removal in Series-Parallel GraphsHershkowitz, D. Ellis / Li, Jason et al. | 2022
- 67
-
Chromatic k-Nearest Neighbor Queriesvan der Horst, Thijs / Löffler, Maarten / Staals, Frank et al. | 2022
- 68
-
Maximum Weight b-Matchings in Random-Order StreamsHuang, Chien-Chung / Sellier, François et al. | 2022
- 69
-
Embedding Phylogenetic Trees in Networks of Low Treewidthvan Iersel, Leo / Jones, Mark / Weller, Mathias et al. | 2022
- 70
-
Vertex Sparsifiers for Hyperedge ConnectivityJiang, Han / Huang, Shang-En / Saranurak, Thatchaphol / Zhang, Tian et al. | 2022
- 71
-
Approximation Algorithms for Round-UFP and Round-SAPKar, Debajyoti / Khan, Arindam / Wiese, Andreas et al. | 2022
- 72
-
Optimizing Safe Flow Decompositions in DAGsKhan, Shahbaz / Tomescu, Alexandru I. et al. | 2022
- 73
-
Scheduling Kernels via Configuration LPKnop, Dušan / Koutecký, Martin et al. | 2022
- 74
-
Abstract Morphing Using the Hausdorff Distance and Voronoi Diagramsde Kogel, Lex / van Kreveld, Marc / Vermeulen, Jordi L. et al. | 2022
- 75
-
Average Sensitivity of the Knapsack ProblemKumabe, Soh / Yoshida, Yuichi et al. | 2022
- 76
-
Cardinality Estimation Using Gumbel DistributionŁukasiewicz, Aleksander / Uznański, Przemysław et al. | 2022
- 77
-
(In-)Approximability Results for Interval, Resource Restricted, and Low Rank SchedulingMaack, Marten / Pukrop, Simon / Rasmussen, Anna Rodriguez et al. | 2022
- 78
-
Localized Geometric Moves to Compute Hyperbolic Structures on Triangulated 3-ManifoldsMaria, Clément / Rouillé, Owen et al. | 2022
- 79
-
Computing Treedepth in Polynomial Space and Linear FPT TimeNadara, Wojciech / Pilipczuk, Michał / Smulewicz, Marcin et al. | 2022
- 80
-
The Pareto Cover ProblemNatura, Bento / Neuwohner, Meike / Weltge, Stefan et al. | 2022
- 81
-
A Unified Framework for HopsetsNeiman, Ofer / Shabat, Idan et al. | 2022
- 82
-
Data Structures for Node Connectivity QueriesNutov, Zeev et al. | 2022
- 83
-
Improved Bounds for Online Balanced Graph Re-PartitioningRajaraman, Rajmohan / Wasim, Omer et al. | 2022
- 84
-
An Empirical Evaluation of k-Means CoresetsSchwiegelshohn, Chris / Sheikh-Omar, Omar Ali et al. | 2022
- 85
-
An Improved Algorithm for Finding the Shortest Synchronizing WordsSzykuła, Marek / Zyzik, Adam et al. | 2022
- 86
-
Fast RSK Correspondence by Doubling SearchTiskin, Alexander et al. | 2022
- 87
-
Insertion Time of Random Walk Cuckoo Hashing below the Peeling ThresholdWalzer, Stefan et al. | 2022
- 88
-
ParGeo: A Library for Parallel Computational GeometryWang, Yiqiu / Yesantharao, Rahul / Yu, Shangdi / Dhulipala, Laxman / Gu, Yan / Shun, Julian et al. | 2022
- 89
-
Combining Predicted and Live Traffic with Time-Dependent A* PotentialsWerner, Nils / Zeitz, Tim et al. | 2022
- 90
-
Approximating Dynamic Time Warping Distance Between Run-Length Encoded StringsXi, Zoe / Kuszmaul, William et al. | 2022
- 91
-
Correlated Stochastic Knapsack with a Submodular ObjectiveYang, Sheng / Khuller, Samir / Choudhary, Sunav / Mitra, Subrata / Mahadik, Kanak et al. | 2022
- 92
-
Faster Algorithm for Unique (k,2)-CSPZamir, Or et al. | 2022