default search action
Computational Geometry, Volume 90
Volume 90, October 2020
- Thao Do:
Extending Erdős-Beck's theorem to higher dimensions. 101625 - Prosenjit Bose, Thomas C. Shermer:
Gathering by repulsion. 101627 - Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani:
1-bend upward planar slope number of SP-digraphs. 101628 - Erik D. Demaine, Matias Korman, Jason S. Ku, Joseph S. B. Mitchell, Yota Otachi, André van Renssen, Marcel Roeloffzen, Ryuhei Uehara, Yushi Uno:
Symmetric assembly puzzles are hard, beyond a few pieces. 101648 - Imre Bárány, Nabil H. Mustafa:
An application of the universality theorem for Tverberg partitions to data depth and hitting convex sets. 101649 - Sayan Bandyapadhyay, Neeraj Kumar, Subhash Suri, Kasturi R. Varadarajan:
Improved approximation bounds for the minimum constraint removal problem. 101650 - Talha Bin Masood, Tathagata Ray, Vijay Natarajan:
Parallel computation of alpha complexes for biomolecules. 101651
- Stephane Durocher, Shahin Kamali:
Foreword. 101652 - Ahmad Biniaz, Alfredo García:
Packing plane spanning trees into a point set. 101653 - Jie Xue, Yuan Li, Ravi Janardan:
Approximate range closest-pair queries. 101654 - Ka Yaw Teo, Ovidiu Daescu, Kyle Fox:
Trajectory planning for an articulated probe. 101655 - Israel Aldana-Galván, Carlos Alegría, Jose Luis Álvarez-Rebollar, Nestaly Marín-Nevárez, Erick Solís-Villarreal, Jorge Urrutia, Carlos Velarde:
Finding minimum witness sets in orthogonal polygons. 101656 - Nina Amenta, Carlos Rojas:
Dihedral deformation and rigidity. 101657 - Robin Lynne Belton, Brittany Terese Fasy, Rostik Mertz, Samuel Micka, David L. Millman, Daniel Salinas, Anna Schenfisch, Jordan Schupbach, Lucia Williams:
Reconstructing embedded graphs from persistence diagrams. 101658
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.