35th International Symposium on Computational Geometry : SoCG 2019, June 18-21, 2019, Portland, Oregon, USA (Englisch)
Freier Zugriff
- Neue Suche nach: International Symposium on Computational Geometry
- Weitere Informationen zu International Symposium on Computational Geometry:
- http://d-nb.info/gnd/1190656124
- Neue Suche nach: Barequet, Gill
- Neue Suche nach: Wang, Yusu
- Neue Suche nach: International Symposium on Computational Geometry
- Weitere Informationen zu International Symposium on Computational Geometry:
- http://d-nb.info/gnd/1190656124
2019
-
ISBN:
- Konferenzband / Elektronische Ressource
-
Titel:35th International Symposium on Computational Geometry : SoCG 2019, June 18-21, 2019, Portland, Oregon, USA
-
Weitere Titelangaben:SoCG 2019
-
Beteiligte:Barequet, Gill ( Herausgeber:in ) / Wang, Yusu ( Herausgeber:in ) / International Symposium on Computational Geometry ( Autor:in )
-
Kongress:International Symposium on Computational Geometry ; 35 ; 2019 ; Portland, Or.
SoCG ; 35 ; 2019 ; Portland, Or. -
Erschienen in:LIPIcs ; vol. 129
-
Verlag:
-
Erscheinungsort:Saarbrücken/Wadern, Germany
-
Erscheinungsdatum:2019
-
Format / Umfang:1 Online-Ressource
-
Anmerkungen:Illustrationen
"The 35th International Symposium on Computational Geometry (SoCG) was held in Portland, Oregon, United States, June 18-21, 2019, as part of the Computational Geometry Week." - Vorwort
Literaturangaben -
ISBN:
-
DOI:
-
Medientyp:Konferenzband
-
Format:Elektronische Ressource
-
Sprache:Englisch
- Neue Suche nach: 54.80 / 31.59 / 54.73
- Weitere Informationen zu Basisklassifikation
- Neue Suche nach: 00B25 / 68U05 / *68-06
- Weitere Informationen zu Mathematics Subject Classification
-
Klassifikation:
-
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
-
A Geometric Data Structure from Neuroscience (Invited Talk)Dasgupta, Sanjoy et al. | 2019
- 2
-
Some Geometric and Computational Challenges Arising in Structural Molecular Biology (Invited Talk)Donald, Bruce R. et al. | 2019
- 3
-
A New Lower Bound for Semigroup Orthogonal Range SearchingAfshani, Peyman et al. | 2019
- 4
-
Independent Range Sampling, Revisited AgainAfshani, Peyman / Phillips, Jeff M. et al. | 2019
- 5
-
An Efficient Algorithm for Generalized Polynomial Partitioning and Its ApplicationsAgarwal, Pankaj K. / Aronov, Boris / Ezra, Esther / Zahl, Joshua et al. | 2019
- 6
-
Efficient Algorithms for Geometric Partial MatchingAgarwal, Pankaj K. / Chang, Hsien-Chih / Xiao, Allen et al. | 2019
- 7
-
Connecting the Dots (with Minimum Crossings)Agrawal, Akanksha / Guśpiel, Grzegorz / Madathil, Jayakrishnan / Saurabh, Saket / Zehavi, Meirav et al. | 2019
- 8
-
General Techniques for Approximate Incidences and Their Application to the Camera Posing ProblemAiger, Dror / Kaplan, Haim / Kokiopoulou, Efi / Sharir, Micha / Zeisl, Bernhard et al. | 2019
- 9
-
Circumscribing Polygons and Polygonizations for Disjoint Line SegmentsAkitaya, Hugo A. / Korman, Matias / Rudoy, Mikhail / Souvaine, Diane L. / Tóth, Csaba D. et al. | 2019
- 10
-
Morphing Contact Representations of GraphsAngelini, Patrizio / Chaplick, Steven / Cornelsen, Sabine / Da Lozzo, Giordano / Roselli, Vincenzo et al. | 2019
- 11
-
When Convexity Helps Collapsing ComplexesAttali, Dominique / Lieutier, André / Salinas, David et al. | 2019
- 12
-
Optimal Algorithm for Geodesic Farthest-Point Voronoi DiagramsBarba, Luis et al. | 2019
- 13
-
Upward Book Embeddings of st-GraphsBinucci, Carla / Da Lozzo, Giordano / Di Giacomo, Emilio / Didimo, Walter / Mchedlidze, Tamara / Patrignani, Maurizio et al. | 2019
- 14
-
Bounded Degree Conjecture Holds Precisely for c-Crossing-Critical Graphs with c <= 12Bokal, Drago / Dvořák, Zdeněk / Hliněný, Petr / Leaños, Jesús / Mohar, Bojan / Wiedera, Tilo et al. | 2019
- 15
-
Preconditioning for the Geometric Transportation ProblemKhesin, Andrey Boris / Nikolov, Aleksandar / Paramonov, Dmitry et al. | 2019
- 16
-
The One-Way Communication Complexity of Dynamic Time Warping DistanceBraverman, Vladimir / Charikar, Moses / Kuszmaul, William / Woodruff, David P. / Yang, Lin F. et al. | 2019
- 17
-
Walking the Dog Fast in Practice: Algorithm Engineering of the Fréchet DistanceBringmann, Karl / Künnemann, Marvin / Nusser, André et al. | 2019
- 18
-
Polyline Simplification has Cubic ComplexityBringmann, Karl / Chaudhury, Bhaskar Ray et al. | 2019
- 19
-
A Spanner for the Day AfterBuchin, Kevin / Har-Peled, Sariel / Oláh, Dániel et al. | 2019
- 20
-
Computing Shapley Values in the PlaneCabello, Sergio / Chan, Timothy M. et al. | 2019
- 21
-
On the Metric Distortion of Embedding Persistence Diagrams into Separable Hilbert SpacesCarrière, Mathieu / Bauer, Ulrich et al. | 2019
- 22
-
Convex Polygons in Cartesian ProductsDe Carufel, Jean-Lou / Dumitrescu, Adrian / Meulemans, Wouter / Ophelders, Tim / Pennarun, Claire / Tóth, Csaba D. / Verdonschot, Sander et al. | 2019
- 23
-
Smallest k-Enclosing Rectangle RevisitedChan, Timothy M. / Har-Peled, Sariel et al. | 2019
- 24
-
Dynamic Geometric Data Structures via Shallow CuttingsChan, Timothy M. et al. | 2019
- 25
-
Lower Bounds for Electrical Reduction on SurfacesChang, Hsien-Chih / Cossarini, Marcos / Erickson, Jeff et al. | 2019
- 26
-
Maintaining the Union of Unit Discs Under Insertions with Near-Optimal OverheadAgarwal, Pankaj K. / Cohen, Ravid / Halperin, Dan / Mulzer, Wolfgang et al. | 2019
- 27
-
Almost Tight Lower Bounds for Hard Cutting Problems in Embedded GraphsCohen-Addad, Vincent / Colin de Verdière, Éric / Marx, Dániel / de Mesmay, Arnaud et al. | 2019
- 28
-
The VC Dimension of Metric Balls Under Fréchet and Hausdorff DistancesDriemel, Anne / Phillips, Jeff M. / Psarros, Ioannis et al. | 2019
- 29
-
Dual Circumference and Collinear SetsDujmović, Vida / Morin, Pat et al. | 2019
- 30
-
A Product Inequality for Extreme DistancesDumitrescu, Adrian et al. | 2019
- 31
-
Topological Data Analysis in Information SpaceEdelsbrunner, Herbert / Virk, Žiga / Wagner, Hubert et al. | 2019
- 32
-
Cubic Planar Graphs That Cannot Be Drawn On Few LinesEppstein, David et al. | 2019
- 33
-
Counting Polygon Triangulations is HardEppstein, David et al. | 2019
- 34
-
Topologically Trivial Closed Walks in Directed Surface GraphsErickson, Jeff / Wang, Yipu et al. | 2019
- 35
-
Packing Disks into Disks with Optimal Worst-Case DensityFekete, Sándor P. / Keldenich, Phillip / Scheffer, Christian et al. | 2019
- 36
-
Semi-Algebraic Colorings of Complete GraphsFox, Jacob / Pach, János / Suk, Andrew et al. | 2019
- 37
-
Chunk Reduction for Multi-Parameter Persistent HomologyFugacci, Ulderico / Kerber, Michael et al. | 2019
- 38
-
The Crossing Tverberg TheoremFulek, Radoslav / Gärtner, Bernd / Kupavskii, Andrey / Valtr, Pavel / Wagner, Uli et al. | 2019
- 39
-
Z_2-Genus of Graphs and Minimum Rank of Partial Symmetric MatricesFulek, Radoslav / Kynčl, Jan et al. | 2019
- 40
-
An Experimental Study of Forbidden Patterns in Geometric Permutations by Combinatorial LiftingGoaoc, Xavier / Holmsen, Andreas / Nicaud, Cyril et al. | 2019
- 41
-
Journey to the Center of the Point SetHar-Peled, Sariel / Jones, Mitchell et al. | 2019
- 42
-
Preprocessing Ambiguous Imprecise Pointsvan der Hoog, Ivor / Kostitsyna, Irina / Löffler, Maarten / Speckmann, Bettina et al. | 2019
- 43
-
Rods and Rings: Soft Subdivision Planner for R^3 x S^2Hsu, Ching-Hsiang / Chiang, Yi-Jen / Yap, Chee et al. | 2019
- 44
-
3-Manifold Triangulations with Small TreewidthHuszár, Kristóf / Spreer, Jonathan et al. | 2019
- 45
-
Algorithms for Metric Learning via Contrastive EmbeddingsIhara, Diego / Mohammadi, Neshat / Sidiropoulos, Anastasios et al. | 2019
- 46
-
Exact Computation of the Matching Distance on 2-Parameter Persistence ModulesKerber, Michael / Lesnick, Michael / Oudot, Steve et al. | 2019
- 47
-
Probabilistic Smallest Enclosing Ball in High Dimensions via Subgradient SamplingKrivošija, Amer / Munteanu, Alexander et al. | 2019
- 48
-
A Weighted Approach to the Maximum Cardinality Bipartite Matching Problem with Applications in Geometric SettingsLahn, Nathaniel / Raghvendra, Sharath et al. | 2019
- 49
-
The Unbearable Hardness of Unknottingde Mesmay, Arnaud / Rieck, Yo'av / Sedgwick, Eric / Tancer, Martin et al. | 2019
- 50
-
On Grids in Point-Line Arrangements in the PlaneMirzaei, Mozhgan / Suk, Andrew et al. | 2019
- 51
-
On Weak epsilon-Nets and the Radon NumberMoran, Shay / Yehudayoff, Amir et al. | 2019
- 52
-
Dynamic Planar Point Location in External MemoryMunro, J. Ian / Nekrich, Yakov et al. | 2019
- 53
-
Efficient Algorithms for Ortho-Radial Graph DrawingNiedermann, Benjamin / Rutter, Ignaz / Wolf, Matthias et al. | 2019
- 54
-
On the Chromatic Number of Disjointness Graphs of CurvesPach, János / Tomon, István et al. | 2019
- 55
-
Computing Persistent Homology of Flag Complexes via Strong CollapsesBoissonnat, Jean-Daniel / Pritam, Siddharth et al. | 2019
- 56
-
Ham-Sandwich Cuts and Center Transversals in SubspacesSchnider, Patrick et al. | 2019
- 57
-
Distribution-Sensitive Bounds on Relative Approximations of Geometric RangesTao, Yufei / Wang, Yu et al. | 2019
- 58
-
DTM-Based FiltrationsAnai, Hirokazu / Chazal, Frédéric / Glisse, Marc / Ike, Yuichi / Inakoshi, Hiroya / Tinarrage, Raphaël / Umeda, Yuhei et al. | 2019
- 59
-
A Divide-and-Conquer Algorithm for Two-Point L_1 Shortest Path Queries in Polygonal DomainsWang, Haitao et al. | 2019
- 60
-
Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk GraphsWang, Haitao / Xue, Jie et al. | 2019
- 61
-
Searching for the Closest-Pair in a Query TranslateXue, Jie / Li, Yuan / Rahul, Saladi / Janardan, Ravi et al. | 2019
- 62
-
On the Complexity of the k-Level in Arrangements of PseudoplanesSharir, Micha / Ziv, Chen et al. | 2019
- 63
-
Packing Geometric Objects with Optimal Worst-Case Density (Multimedia Exposition)Becker, Aaron T. / Fekete, Sándor P. / Keldenich, Phillip / Morr, Sebastian / Scheffer, Christian et al. | 2019
- 64
-
Properties of Minimal-Perimeter Polyominoes (Multimedia Exposition)Barequet, Gill / Ben-Shachar, Gil et al. | 2019
- 65
-
A Manual Comparison of Convex Hull Algorithms (Multimedia Exposition)Löffler, Maarten et al. | 2019
- 66
-
Fréchet View - A Tool for Exploring Fréchet Distance Algorithms (Multimedia Exposition)Schäfer, Peter et al. | 2019