{"id":205,"date":"2021-06-14T22:37:07","date_gmt":"2021-06-15T01:37:07","guid":{"rendered":"https:\/\/projects.cs.dal.ca\/cccg2021\/?p=205"},"modified":"2021-06-14T22:46:09","modified_gmt":"2021-06-15T01:46:09","slug":"cccg-2021-accepted-papers","status":"publish","type":"post","link":"https:\/\/projects.cs.dal.ca\/cccg2021\/cccg-2021-accepted-papers\/","title":{"rendered":"CCCG 2021 Accepted Papers"},"content":{"rendered":"\n<ul class=\"wp-block-list\"><li>Peyman Afshani and Rasmus Killmann.\u00a0Rectangle Stabbing and Orthogonal Range Reporting Lower Bounds in Moderate Dimensions<\/li><li>Eva Vanessa Bolle and Linda Kleist.\u00a0Folding Polyiamonds into Octahedra<\/li><li><a href=\"http:\/\/cs.smith.edu\/~jorourke\/\">Joseph O&#8217;Rourke<\/a>\u00a0and Costin Vilcu.\u00a0Cut Locus Realizations on Convex Polyhedra<\/li><li><a href=\"http:\/\/cs.usu.edu\/people\/haitaowang\/\">Haitao Wang<\/a>\u00a0and Yiming Zhao.\u00a0An Optimal Algorithm for L_1 Shortest Paths in Unit-Disk Graphs<\/li><li><a href=\"http:\/\/www.ruhr-uni-bochum.de\/lmi\/buchin\/\u200e\">Maike Buchin<\/a>\u00a0and Leonie Selbach.\u00a0Decomposing Polygons into Fat Components<\/li><li><a href=\"http:\/\/www.ics.uci.edu\/~eppstein\/\">David Eppstein<\/a>, Daniel Frishberg and Martha C Osegueda.\u00a0Angles of Arc-Polygons and Lombardi Drawings of Cacti<\/li><li>Hugo A. Akitaya, Brad Ballinger, Erik D. Demaine, Thomas C. Hull and Christiane Schmidt.\u00a0Folding points to a point and lines to a line<\/li><li>Miguel Bosch and\u00a0<a href=\"http:\/\/skelk.sdf-eu.org\/\">Steven Kelk<\/a>.\u00a0An improved kernel for the flip distance problem on simple convex polygons<\/li><li><a href=\"https:\/\/members.loria.fr\/Olivier.Devillers\/\">Olivier Devillers<\/a>\u00a0and\u00a0<a href=\"https:\/\/members.loria.fr\/CDumenil\/\">Charles Dum\u00e9nil<\/a>.\u00a0Stochastic Analysis of Empty-Region Graphs<\/li><li><a href=\"https:\/\/personal.utdallas.edu\/~daescu\">Ovidiu Daescu<\/a>\u00a0and\u00a0<a href=\"https:\/\/personal.utdallas.edu\/~ka.teo\">Ka Yaw Teo<\/a>.\u00a0The Discrete Median and Center Line Segment Problems in the Plane<\/li><li>Mirela Damian and Robin Flatland.\u00a0Unfolding a New Class of Polycube Graphs of Arbitrary Genus<\/li><li>Tetsuya Araki, Hiroyuki Miyata and\u00a0<a href=\"http:\/\/www.cs.gunma-u.ac.jp\/~nakano\/\">Shin-Ichi Nakano<\/a>.\u00a0Dispersion on Intervals<\/li><li><a href=\"http:\/\/www.uni-koblenz-landau.de\/koblenz\/fb4\/institute\/IFI\/AGFrey\/personen\/frey\">Hannes Frey<\/a>\u00a0and Lucas B\u00f6ltz.\u00a0Automatically Testing Containedness Between Geometric Graph Classes Defined by Inclusion, Exclusion and Transfer Axioms<\/li><li>Sharareh Alipour.\u00a0On guarding polygons with holes<\/li><li><a href=\"http:\/\/pub.ist.ac.at\/~mdvorak\/\">Martin Dvorak<\/a>\u00a0and Sara Nicholson.\u00a0Massively Winning Configurations in the Convex Grabbing Game on the Plane<\/li><li><a href=\"https:\/\/sites.google.com\/view\/mishrapawan\">Pawan K. Mishra<\/a>\u00a0and Gautam K Das.\u00a0Approximation Algorithms For The Euclidean Dispersion Problems<\/li><li>Hill Darryl,\u00a0<a href=\"http:\/\/www.jean-lou.com\">Jean-Lou De Carufel<\/a>, Lu\u00eds Fernando Schultz Xavier Da Silveira, Sasanka Roy and Anil Maheshwari.\u00a0Constant Delay Lattice Train Schedules<\/li><li>Princy Jain and\u00a0<a href=\"http:\/\/cs.usu.edu\/people\/haitaowang\/\">Haitao Wang<\/a>.\u00a0Algorithms for Covering Barrier Points by Mobile Sensors with Line Constraint<\/li><li>Sangram Kishor Jena and Gautam K Das.\u00a0Total Domination in Geometric Unit Disk Graphs<\/li><li><a href=\"http:\/\/cglab.ca\/~biniaz\/\">Ahmad Biniaz<\/a>,\u00a0<a href=\"http:\/\/cg.scs.carleton.ca\/~jit\">Prosenjit Bose<\/a>\u00a0and Yunkai Wang.\u00a0Simple Linear Time Algorithms For Piercing Pairwise Intersecting Disks<\/li><li><a href=\"http:\/\/www.ist.tugraz.at\/staff\/aichholzer\/\">Oswin Aichholzer<\/a>.\u00a0Another Small but Long Step for Crossing Numbers: cr(13)=225 and cr(14)=315<\/li><li>Erik Demaine, Martin Demaine, Yevhenii Diomidov, Tonan Kamata,\u00a0<a href=\"http:\/\/www.jaist.ac.jp\/~uehara\">Ryuhei Uehara<\/a>\u00a0and Hanyu Zhang.\u00a0Any Regular Polyhedron Can Transform to Another by O(1) Refoldings<\/li><li><a href=\"http:\/\/michelletran.me\/\">Michelle Tran<\/a>.\u00a0Practical Methods for the Embroidery Problem<\/li><li>Annika Bonerath,\u00a0<a href=\"https:\/\/www.geoinfo.uni-bonn.de\/en\/team\/haunert\/haunert-en?set_language=en\">Jan-Henrik Haunert<\/a>, Joseph S. B. Mitchell and Benjamin Niedermann.\u00a0Shortcut Hulls: Vertex-restricted Outer Simplifications of Polygons<\/li><li><a href=\"http:\/\/www.cs.uwaterloo.ca\/~biedl\">Therese Biedl<\/a>, Giuseppe Liotta, Jayson Lynch and\u00a0<a href=\"http:\/\/mozart.diei.unipg.it\/montecchiani\/\">Fabrizio Montecchiani<\/a>.\u00a0Generalized LR-drawings of trees<\/li><li>Thore Thie\u00dfen and Jan Vahrenhold.\u00a0Oblivious Median Slope Selection<\/li><li>Ritesh Seth, Anil Maheshwari and Subhas Nandy.\u00a0An Acrophobic Guard Watchtower Problem on Terrains<\/li><li>Travis Gagie.\u00a0Compact Euler Tours of Trees with Small Maximum Degree<\/li><li>Vishwanath Reddy Singireddy and Manjanna B.\u00a0Constrained Obnoxious Facility Location on a Line Segment<\/li><li>Allan Sapucaia, Andre A. Cire, Pedro J. de Rezende and Cid C. de Souza.\u00a0Convex Bichromatic Quadrangulation of Point Sets<\/li><li>Rachana Madhukara, Vincent Bian and Erik Demaine.\u00a0Edge-Unfolding Prismatoids: Tall or Rectangular Base<\/li><li>Andrew Nathenson.\u00a0Axis-Aligned Square Contact Representations<\/li><li>Nathan van Beusekom, Kevin Buchin, Hidde Koerts, Wouter Meulemans, Benjamin Rodatz and\u00a0<a href=\"http:\/\/www.win.tue.nl\/~speckman\/\">Bettina Speckmann<\/a>.\u00a0Near-Delaunay Metrics<\/li><li><a href=\"http:\/\/www.staff.science.uu.nl\/~loffl001\">Maarten L\u00f6ffler<\/a>\u00a0and J\u00e9r\u00f4me Urhausen.\u00a0Mapping Points to the Grid with Bounded Hausdorff Distance<\/li><li><a href=\"http:\/\/erikdemaine.org\/\">Erik D. Demaine<\/a>, Jayson Lynch, Mikhail Rudoy and Yushi Uno.\u00a0Yin-Yang Puzzles are NP-complete<\/li><li>Bogdan Armaselu.\u00a0Extensions of the Maximum Bichromatic Separating Rectangle Problem<\/li><li>Taehoon Ahn, Jongmin Choi, Chaeyoon Chung,\u00a0<a href=\"http:\/\/www.postech.ac.kr\/~heekap\">Hee-Kap Ahn<\/a>, Sang Won Bae and Sang Duk Yoon.\u00a0Rearranging a Sequence of Points onto a Line<\/li><li>Mincheol Kim and\u00a0<a href=\"http:\/\/www.postech.ac.kr\/~heekap\">Hee-Kap Ahn<\/a>.\u00a0Minimum-Link Shortest Paths for Polygons amidst Rectilinear Obstacles<\/li><li>Justin Dallant and\u00a0<a href=\"http:\/\/people.inf.ethz.ch\/schnpatr\/\">Patrick Schnider<\/a>.\u00a0Efficiently stabbing convex polygons and variants of the Hadwiger-Debrunner (p, q)-theorem<\/li><li><a href=\"http:\/\/www.ulb.ac.be\/di\/algo\/jcardin\/\">Jean Cardinal<\/a>,\u00a0<a href=\"http:\/\/homepages.ulb.ac.be\/~jcardin\/\">Justin Dallant<\/a>\u00a0and\u00a0<a href=\"https:\/\/di.ulb.ac.be\/algo\/iacono\/\">John Iacono<\/a>.\u00a0Approximability of (Simultaneous) Class Cover for Boxes<\/li><li>Austin Barr, Calvin Chung and Aaron Williams.\u00a0Block Dude Puzzles are NP-Hard (and the Rugs Really Tie the Reductions Together)<\/li><li>Aster Greenblatt, Robert Hearn, Oscar Hernandez, Yichao Hou,\u00a0<a href=\"http:\/\/www.alg.cei.uec.ac.jp\/itohiro\/\">Hiro Ito<\/a>, Joshua Kang, Aaron Williams and Andrew Winslow.\u00a0Turning Around and Around: Motion Planning through Thick and Thin Turnstiles<\/li><li>Azadeh Tabatabaei, Farehe Soheil, Mohammad Aletaha and Mohammad Ghodsi.\u00a0Integer Cow-path Problem and Simple Robot Street Search<\/li><\/ul>\n","protected":false},"excerpt":{"rendered":"<p>Peyman Afshani and Rasmus Killmann.\u00a0Rectangle Stabbing and Orthogonal Range Reporting Lower Bounds in Moderate Dimensions Eva Vanessa Bolle and Linda Kleist.\u00a0Folding Polyiamonds into Octahedra Joseph O&#8217;Rourke\u00a0and Costin Vilcu.\u00a0Cut Locus Realizations on Convex Polyhedra Haitao Wang\u00a0and Yiming Zhao.\u00a0An Optimal Algorithm for L_1 Shortest Paths in Unit-Disk Graphs Maike Buchin\u00a0and Leonie Selbach.\u00a0Decomposing Polygons into Fat Components David &hellip;<\/p>\n<p class=\"read-more\"> <a class=\"\" href=\"https:\/\/projects.cs.dal.ca\/cccg2021\/cccg-2021-accepted-papers\/\"> <span class=\"screen-reader-text\">CCCG 2021 Accepted Papers<\/span> Read More \u00bb<\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[3],"tags":[],"class_list":["post-205","post","type-post","status-publish","format-standard","hentry","category-news"],"_links":{"self":[{"href":"https:\/\/projects.cs.dal.ca\/cccg2021\/wp-json\/wp\/v2\/posts\/205","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/projects.cs.dal.ca\/cccg2021\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/projects.cs.dal.ca\/cccg2021\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/projects.cs.dal.ca\/cccg2021\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/projects.cs.dal.ca\/cccg2021\/wp-json\/wp\/v2\/comments?post=205"}],"version-history":[{"count":3,"href":"https:\/\/projects.cs.dal.ca\/cccg2021\/wp-json\/wp\/v2\/posts\/205\/revisions"}],"predecessor-version":[{"id":209,"href":"https:\/\/projects.cs.dal.ca\/cccg2021\/wp-json\/wp\/v2\/posts\/205\/revisions\/209"}],"wp:attachment":[{"href":"https:\/\/projects.cs.dal.ca\/cccg2021\/wp-json\/wp\/v2\/media?parent=205"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/projects.cs.dal.ca\/cccg2021\/wp-json\/wp\/v2\/categories?post=205"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/projects.cs.dal.ca\/cccg2021\/wp-json\/wp\/v2\/tags?post=205"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}