Graph Reconstruction by Discrete Morse Theory (Englisch)
Freier Zugriff
- Neue Suche nach: Dey, Tamal K.
- Neue Suche nach: Wang, Jiayuan
- Neue Suche nach: Wang, Yusu
- Neue Suche nach: Dey, Tamal K.
- Neue Suche nach: Wang, Jiayuan
- Neue Suche nach: Wang, Yusu
- Neue Suche nach: Speckmann, Bettina
- Neue Suche nach: Tóth, Csaba D.
In:
LIPIcs, Volume 99, SoCG 2018
: 34th International Symposium on Computational Geometry (SoCG 2018)
;
99
;
31:1-31:15
;
2018
-
ISBN:
-
ISSN:
- Aufsatz (Konferenz) / Elektronische Ressource
-
Titel:Graph Reconstruction by Discrete Morse Theory
-
Beteiligte:Dey, Tamal K. ( Autor:in ) / Wang, Jiayuan ( Autor:in ) / Wang, Yusu ( Autor:in ) / Speckmann, Bettina ( Herausgeber:in ) / Tóth, Csaba D. ( Herausgeber:in )
-
Erschienen in:LIPIcs, Volume 99, SoCG 2018 : 34th International Symposium on Computational Geometry (SoCG 2018) ; 99 ; 31:1-31:15Leibniz International Proceedings in Informatics (LIPIcs) ; 99 ; 31:1-31:15
-
Verlag:
- Neue Suche nach: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
-
Erscheinungsdatum:08.06.2018
-
Format / Umfang:15 pages , 1550853 byte
-
Anmerkungen:LIPIcs, Vol. 99, 34th International Symposium on Computational Geometry (SoCG 2018), pages 31:1-31:15
-
ISBN:
-
ISSN:
-
DOI:
-
Medientyp:Aufsatz (Konferenz)
-
Format:Elektronische Ressource
-
Sprache:Englisch
-
Schlagwörter:
-
Lizenzbestimmungen:
-
Datenquelle:
Inhaltsverzeichnis Konferenzband
Die Inhaltsverzeichnisse werden automatisch erzeugt und basieren auf den im Index des TIB-Portals verfügbaren Einzelnachweisen der enthaltenen Beiträge. Die Anzeige der Inhaltsverzeichnisse kann daher unvollständig oder lückenhaft sein.
- 1
-
Sampling Conditions for Conforming Voronoi Meshing by the VoroCrust AlgorithmAbdelkader, Ahmed / Bajaj, Chandrajit L. / Ebeida, Mohamed S. / Mahmoud, Ahmed H. / Mitchell, Scott A. / Owens, John D. / Rushdi, Ahmad A. et al. | 2018
- 2
-
Approximating Maximum Diameter-Bounded Subgraph in Unit Disk GraphsAbu-Affash, A. Karim / Carmi, Paz / Maheshwari, Anil / Morin, Pat / Smid, Michiel / Smorodinsky, Shakhar et al. | 2018
- 3
-
Vietoris-Rips and Cech Complexes of Metric GluingsAdamaszek, Michal / Adams, Henry / Gasparovic, Ellen / Gommel, Maria / Purvine, Emilie / Sazdanovic, Radmila / Wang, Bei / Wang, Yusu / Ziegelmeier, Lori et al. | 2018
- 4
-
Improved Dynamic Geodesic Nearest Neighbor Searching in a Simple PolygonAgarwal, Pankaj K. / Arge, Lars / Staals, Frank et al. | 2018
- 5
-
O~(n^{1/3})-Space Algorithm for the Grid Graph Reachability ProblemAshida, Ryo / Nakagawa, Kotaro et al. | 2018
- 6
-
The Reverse Kakeya ProblemBae, Sang Won / Cabello, Sergio / Cheong, Otfried / Choi, Yoonsung / Stehn, Fabian / Yoon, Sang Duk et al. | 2018
- 7
-
Capacitated Covering Problems in Geometric SpacesBandyapadhyay, Sayan / Bhowmick, Santanu / Inamdar, Tanmay / Varadarajan, Kasturi et al. | 2018
- 8
-
Faster Algorithms for some Optimization Problems on Collinear PointsBiniaz, Ahmad / Bose, Prosenjit / Carmi, Paz / Maheshwari, Anil / Munro, Ian / Smid, Michiel et al. | 2018
- 9
-
Local Criteria for Triangulation of ManifoldsBoissonnat, Jean-Daniel / Dyer, Ramsay / Ghosh, Arijit / Wintraecken, Mathijs et al. | 2018
- 10
-
The Reach, Metric Distortion, Geodesic Convexity and the Variation of Tangent SpacesBoissonnat, Jean-Daniel / Lieutier, André / Wintraecken, Mathijs et al. | 2018
- 11
-
Orthogonal Terrain Guarding is NP-completeBonnet, Édouard / Giannopoulos, Panos et al. | 2018
- 12
-
QPTAS and Subexponential Algorithm for Maximum Clique on Disk GraphsBonnet, Édouard / Giannopoulos, Panos / Kim, Eun Jung / Rzazewski, Pawel / Sikora, Florian et al. | 2018
- 13
-
Computational Complexity of the Interleaving DistanceBjerkevik, Håvard Bakke / Botnan, Magnus Bakke et al. | 2018
- 14
-
Sheaf-Theoretic Stratification LearningBrown, Adam / Wang, Bei et al. | 2018
- 15
-
Realizations of Indecomposable Persistence Modules of Arbitrarily Large DimensionBuchet, Mickaël / Escolar, Emerson G. et al. | 2018
- 16
-
Approximating the Distribution of the Median and other Robust Estimators on Uncertain DataBuchin, Kevin / Phillips, Jeff M. / Tang, Pingfan et al. | 2018
- 17
-
Consistent Sets of Lines with no Colorful IncidenceBukh, Boris / Goaoc, Xavier / Hubard, Alfredo / Trager, Matthew et al. | 2018
- 18
-
The HOMFLY-PT Polynomial is Fixed-Parameter TractableBurton, Benjamin A. et al. | 2018
- 19
-
Practical Volume Computation of Structured Convex Bodies, and an Application to Modeling Portfolio Dependencies and Financial CrisesCalès, Ludovic / Chalkis, Apostolos / Emiris, Ioannis Z. / Fisikopoulos, Vissarion et al. | 2018
- 20
-
Subquadratic Encodings for Point ConfigurationsCardinal, Jean / Chan, Timothy M. / Iacono, John / Langerman, Stefan / Ooms, Aurélien et al. | 2018
- 21
-
Algorithms for Low-Distortion Embeddings into Arbitrary 1-Dimensional SpacesCarpenter, Timothy / Fomin, Fedor V. / Lokshtanov, Daniel / Saurabh, Saket / Sidiropoulos, Anastasios et al. | 2018
- 22
-
Fast Approximation and Exact Computation of Negative Curvature Parameters of GraphsChalopin, Jérémie / Chepoi, Victor / Dragan, Feodor F. / Ducoffe, Guillaume / Mohammed, Abdulhakeem / Vaxès, Yann et al. | 2018
- 23
-
Tree Drawings RevisitedChan, Timothy M. et al. | 2018
- 24
-
Approximate Shortest Paths and Distance Oracles in Weighted Unit-Disk GraphsChan, Timothy M. / Skrepetos, Dimitrios et al. | 2018
- 25
-
Dynamic Planar Orthogonal Point Location in Sublogarithmic TimeChan, Timothy M. / Tsakalidis, Konstantinos et al. | 2018
- 26
-
The Density of Expected Persistence Diagrams and its Kernel Based EstimationChazal, Frédéric / Divol, Vincent et al. | 2018
- 27
-
Embedding Graphs into Two-Dimensional Simplicial ComplexesVerdière, Éric Colin de / Magnard, Thomas / Mohar, Bojan et al. | 2018
- 28
-
On the Complexity of Closest Pair via Polar-Pair of Point-SetsDavid, Roee / C. S., Karthik / Laekhanukit, Bundit et al. | 2018
- 29
-
Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded StretchDemaine, Erik D. / Fekete, Sándor P. / Keldenich, Phillip / Scheffer, Christian / Meijer, Henk et al. | 2018
- 30
-
3D Snap RoundingDevillers, Olivier / Lazard, Sylvain / Lenhart, William J. et al. | 2018
- 31
-
Graph Reconstruction by Discrete Morse TheoryDey, Tamal K. / Wang, Jiayuan / Wang, Yusu et al. | 2018
- 32
-
Computing Bottleneck Distance for 2-D Interval Decomposable ModulesDey, Tamal K. / Xin, Cheng et al. | 2018
- 33
-
Structure and Generation of Crossing-Critical GraphsDvorák, Zdenek / Hlinený, Petr / Mohar, Bojan et al. | 2018
- 34
-
The Multi-cover Persistence of Euclidean BallsEdelsbrunner, Herbert / Osang, Georg et al. | 2018
- 35
-
Smallest Enclosing Spheres and Chernoff Points in BregmanGeometryEdelsbrunner, Herbert / Virk, Ziga / Wagner, Hubert et al. | 2018
- 36
-
Near Isometric Terminal Embeddings for Doubling MetricsElkin, Michael / Neiman, Ofer et al. | 2018
- 37
-
Products of Euclidean Metrics and Applications to Proximity Questions among CurvesEmiris, Ioannis Z. / Psarros, Ioannis et al. | 2018
- 38
-
Rainbow Cycles in Flip GraphsFelsner, Stefan / Kleist, Linda / Mütze, Torsten / Sering, Leon et al. | 2018
- 39
-
Hanani-Tutte for Approximating Maps of GraphsFulek, Radoslav / Kyncl, Jan et al. | 2018
- 40
-
The Z_2-Genus of Kuratowski MinorsFulek, Radoslav / Kyncl, Jan et al. | 2018
- 41
-
Shellability is NP-CompleteGoaoc, Xavier / Paták, Pavel / Patáková, Zuzana / Tancer, Martin / Wagner, Uli et al. | 2018
- 42
-
Optimal Morphs of Planar Orthogonal Drawingsvan Goethem, Arthur / Verbeek, Kevin et al. | 2018
- 43
-
Computational Topology and the Unique Games ConjectureGrochow, Joshua A. / Tucker-Foltz, Jamie et al. | 2018
- 44
-
Solving Large-Scale Minimum-Weight Triangulation Instances to Provable OptimalityHaas, Andreas et al. | 2018
- 45
-
Dynamic Smooth Compressed Quadtreesvan der Hoog, Ivor / Khramtcova, Elena / Löffler, Maarten et al. | 2018
- 46
-
On the Treewidth of Triangulated 3-ManifoldsHuszár, Kristóf / Spreer, Jonathan / Wagner, Uli et al. | 2018
- 47
-
On Partial Covering For Geometric Set SystemsInamdar, Tanmay / Varadarajan, Kasturi et al. | 2018
- 48
-
Optimality of Geometric Local SearchJartoux, Bruno / Mustafa, Nabil H. et al. | 2018
- 49
-
Odd Yao-Yao Graphs are Not SpannersJin, Yifei / Li, Jian / Zhan, Wei et al. | 2018
- 50
-
Deletion in Abstract Voronoi Diagrams in Expected Linear TimeJunginger, Kolja / Papadopoulou, Evanthia et al. | 2018
- 51
-
From a (p,2)-Theorem to a Tight (p,q)-TheoremKeller, Chaya / Smorodinsky, Shakhar et al. | 2018
- 52
-
Coloring Intersection Hypergraphs of Pseudo-DisksKeszegh, Balázs et al. | 2018
- 53
-
Minimizing Crossings in Constrained Two-Sided Circular Graph LayoutsKlute, Fabian / Nöllenburg, Martin et al. | 2018
- 54
-
Discrete Stratified Morse Theory: A User's GuideKnudson, Kevin / Wang, Bei et al. | 2018
- 55
-
An Optimal Algorithm to Compute the Inverse Beacon Attraction RegionKostitsyna, Irina / Kouhestani, Bahram / Langerman, Stefan / Rappaport, David et al. | 2018
- 56
-
On Optimal Polyline Simplification Using the Hausdorff and Fréchet Distancevan Kreveld, Marc / Löffler, Maarten / Wiratma, Lionov et al. | 2018
- 57
-
Graph-Based Time-Space Trade-Offs for Approximate Near NeighborsLaarhoven, Thijs et al. | 2018
- 58
-
A Nearly Optimal Algorithm for the Geodesic Voronoi Diagram of Points in a Simple PolygonLiu, Chih-Hung et al. | 2018
- 59
-
Further Consequences of the Colorful Helly HypothesisMartínez-Sandoval, Leonardo / Roldán-Pensado, Edgardo / Rubin, Natan et al. | 2018
- 60
-
Random Walks on Polytopes of Constant CorankMilatz, Malte et al. | 2018
- 61
-
Table Based Detection of Degenerate Predicates in Free Space ConstructionMilenkovic, Victor / Sacks, Elisha / Butt, Nabeel et al. | 2018
- 62
-
Approximate Range Queries for ClusteringOh, Eunjin / Ahn, Hee-Kap et al. | 2018
- 63
-
Point Location in Dynamic Planar SubdivisionsOh, Eunjin / Ahn, Hee-Kap et al. | 2018
- 64
-
Edge-Unfolding Nearly Flat Convex CapsO'Rourke, Joseph et al. | 2018
- 65
-
A Crossing Lemma for MultigraphsPach, János / Tóth, Géza et al. | 2018
- 66
-
Near-Optimal Coresets of Kernel Density EstimatesPhillips, Jeff M. / Tai, Wai Ming et al. | 2018
- 67
-
Optimal Analysis of an Online Algorithm for the Bipartite Matching Problem on a LineRaghvendra, Sharath et al. | 2018
- 68
-
Almost All String Graphs are Intersection Graphs of Plane Convex SetsPach, János / Reed, Bruce / Yuditsky, Yelena et al. | 2018
- 69
-
An Improved Bound for the Size of the Set A/A+ARoche-Newton, Oliver et al. | 2018
- 70
-
Fractal Dimension and Lower Bounds for Geometric ProblemsSidiropoulos, Anastasios / Singhal, Kritika / Sridhar, Vijay et al. | 2018
- 71
-
The Trisection Genus of Standard Simply Connected PL 4-ManifoldsSpreer, Jonathan / Tillmann, Stephan et al. | 2018
- 72
-
An O(n log n)-Time Algorithm for the k-Center Problem in TreesWang, Haitao / Zhang, Jingru et al. | 2018
- 73
-
New Bounds for Range Closest-Pair ProblemsXue, Jie / Li, Yuan / Rahul, Saladi / Janardan, Ravi et al. | 2018
- 74
-
Coordinated Motion Planning: The Video (Multimedia Exposition)Becker, Aaron T. / Fekete, Sándor P. / Keldenich, Phillip / Konitzny, Matthias / Lin, Lillian / Scheffer, Christian et al. | 2018
- 75
-
Geometric Realizations of the 3D Associahedron (Multimedia Exposition)Devadoss, Satyan L. / Johnson, Daniel D. / Lee, Justin / Warley, Jackson et al. | 2018
- 76
-
Star Unfolding of Boxes (Multimedia Exposition)Demas, Dani / Devadoss, Satyan L. / Hong, Yu Xuan et al. | 2018
- 77
-
VoroCrust Illustrated: Theory and Challenges (Multimedia Exposition)Abdelkader, Ahmed / Bajaj, Chandrajit L. / Ebeida, Mohamed S. / Mahmoud, Ahmed H. / Mitchell, Scott A. / Owens, John D. / Rushdi, Ahmad A. et al. | 2018