Table of Contents

• Watchman route in a simple polygon with a rubberband algorithmFajie Li, Reinhard Klette. 1-4 [doi]
• Multi-guard covers for polygonal regionsZohreh Jabbari, William S. Evans, David G. Kirkpatrick. 5-8 [doi]
• The 3-dimensional searchlight scheduling problemGiovanni Viglietta, Maurizio Monge. 9-12 [doi]
• Some properties of higher order delaunay and gabriel graphsProsenjit Bose, Sébastien Collette, Ferran Hurtado, Matias Korman, Stefan Langerman, Vera Sacristan, Maria Saumell. 13-16 [doi]
• Existence of zone diagrams in compact subsets of uniformly convex spacesEva Kopecká, Daniel Reem, Simeon Reich. 17-20 [doi]
• Blocking delaunay triangulationsOswin Aichholzer, Ruy Fabila Monroy, Thomas Hackl, Alexander Pilz, Pedro Ramos, Marc J. van Kreveld, Birgit Vogtenhuber. 21-24 [doi]
• Those ubiquitous cut polyhedraDavid Avis. 25 [doi]
• Connected dominating sets on dynamic geometric graphsLeonidas J. Guibas, Nikola Milosavljevic, Arik Motskin. 27-30 [doi]
• Stable roommates and geometric spannersPaz Carmi, Lilach Chaitman. 31-34 [doi]
• 3d local algorithm for dominating sets of unit disk graphsAlaa Eddien Abdallah, Thomas Fevens, Jaroslav Opatrny. 35-38 [doi]
• Direction assignment in wireless networksBoaz Ben-Moshe, Paz Carmi, Lilach Chaitman, Matthew J. Katz, Gila Morgenstern, Yael Stein. 39-42 [doi]
• Combinatorial changes of euclidean minimum spanning tree of moving points in the planeZahed Rahmati, Alireza Zarei. 43-45 [doi]
• k-sets and continuous motion in R:::3:::Marek Sulovský, Uli Wagner. 47-50 [doi]
• An optimal solution for dynamic polar diagramEbrahim Ehsanfar, Bahram Sadeghi Bigham, Najmeh Madadi. 51-54 [doi]
• Towards a dynamic data structure for efficient bounded line range searchThuy Le, Bradford G. Nickerson. 55-58 [doi]
• On degeneracy of lower envelopes of algebraic surfacesKimikazu Kato. 59-62 [doi]
• Ghost chimneysDavid Charlton, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, Pat Morin, Ryuhei Uehara. 63-66 [doi]
• Deflating polygons to the limitPerouz Taslakian, Isabel Hubard. 67-70 [doi]
• Coloring geometric hypergraph defined by an arrangement of half-planesRadoslav Fulek. 71-74 [doi]
• On a dispersion problem in grid labelingMinghui Jiang, Vincent Pilaud, Pedro J. Tejada. 75-78 [doi]
• Robot kabaddiKyle Klein, Subhash Suri. 79-82 [doi]
• Compatible pointed pseudo-triangulationsThomas Hackl, Oswin Aichholzer, Birgit Vogtenhuber. 91-94 [doi]
• Optimal encoding of triangular and quadrangular meshes with fixed topologyLuca Castelli Aleardi, Eric Fusy, Thomas Lewiner. 95-98 [doi]
• Bounded-degree polyhedronization of point setsGill Barequet, Nadia Benbernou, David Charlton, Erik D. Demaine, Martin L. Demaine, Mashhood Ishaque, Anna Lubiw, André Schulz, Diane L. Souvaine, Godfried T. Toussaint, Andrew Winslow. 99-102 [doi]
• Triangulations with many points of even degreeJorge Urrutia, Canek Peláez, Adriana Ramírez-Viguer. 103-106 [doi]
• Maximum geodesic routing in the plane with obstaclesDavid L. Millman, Matthew O Meara, Jack Snoeyink, Vishal Verma. 107-108 [doi]
• Evading equilateral triangles without a mapBraxton Carrigan. 109-112 [doi]
• Watchman tours for polygons with holesAdrian Dumitrescu, Csaba D. Tóth. 113-116 [doi]
• Visibility maintenance of a moving segment observer inside polygons with holesHoda Akbari, Mohammad Ghodsi. 117-120 [doi]
• I/O efficient path traversal in well-shaped tetrahedral meshesCraig Dillabaugh. 121-124 [doi]
• Approximate euclidean ramsey theoremsAdrian Dumitrescu. 131-134 [doi]
• Finding minimal bases in arbitrary spline spacesAna Paula Malheiro, Jorge Stolfi. 135-138 [doi]
• Any monotone boolean function can be realized by interlocked polygonsErik D. Demaine, Martin L. Demaine, Ryuhei Uehara. 139-142 [doi]
• Complete enumeration of small realizable oriented matroidsHiroyuki Miyata, Sonoko Moriyama, Komei Fukuda. 143-146 [doi]
• Oja medians and centers of gravityDan Chen, Olivier Devillers, John Iacono, Stefan Langerman, Pat Morin. 147-150 [doi]
• The projection median of a set of points in R:::d:::Riddhipratim Basu, Bhaswar Bhattacharya, Tanmoy Talukdar. 151-154 [doi]
• Small strong epsilon netsPradeesha Ashok, Sathish Govindarajan, Janardhan Kulkarni. 155-158 [doi]
• New epsilon-net constructionsJanardhan Kulkarni, Sathish Govindarajan. 159-162 [doi]
• On the perimeter of fat objectsProsenjit Bose, Otfried Cheong, Vida Dujmovic. 163-166 [doi]
• Sweeping minimum perimeter enclosing parallelograms: Optimal crumb cleanupYonit Bousany, Mary Leah Karker, Joseph O'Rourke, Leona Sparaco. 167-170 [doi]
• Minimum enclosing area triangle with a fixed angleProsenjit Bose, Jean-Lou De Carufel. 171-174 [doi]
• Approximate shortest path algorithms for sequences of pairwise disjoint simple polygonsXiuxia Pan, Fajie Li, Reinhard Klette. 175-178 [doi]
• Speed-constrained geodesic fréchet distance inside a simple polygonAnil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz, Hamid Zarrabi-Zadeh. 179-182 [doi]
• Hausdorff core of a one reflex vertex polygonRobert Fraser, Patrick K. Nicholson. 183-186 [doi]
• Computing straight skeletons of planar straight-line graphs based on motorcycle graphsStefan Huber, Martin Held. 187-190 [doi]
• Minimum-area drawings of plane 3-treesDebajyoti Mondal, Rahnuma Islam Nishat, Md. Saidur Rahman, Md. Jawaherul Alam. 191-194 [doi]
• Approximating the independent domatic partition problem in random geometric graphs - an experimental studyDhia Mahjoub, Angelika Leskovskaya, David W. Matula. 195-198 [doi]
• Orthogonal thickness of graphsMaryam Tahmasbi, S. Mehdi Hashemi. 199-202 [doi]
• Shooting bricks with orthogonal laser beams: A first step towards internal/external map labelingMaarten Löffler, Martin Nöllenburg. 203-206 [doi]
• Computing the straight skeleton of a monotone polygon in O(n log n) timeGautam K. Das, Asish Mukhopadhyay, Subhas C. Nandy, Sangameswar Patil, S. V. Rao. 207-210 [doi]
• On the variance of random polygonsWilliam L. Steiger, Imre Bárány. 211-214 [doi]
• k-star-shaped polygonsJeff Sember, William Evans. 215-218 [doi]
• Zipper unfoldings of polyhedral complexesAnna Lubiw, Erik D. Demaine, Martin L. Demaine, Arlo Shallit, Jonah Shallit. 219-222 [doi]
• On stretch minimization problem on unit strip paperRyuhei Uehara. 223-226 [doi]
• Determining the robustness of sensor barriersDavid G. Kirkpatrick. 227 [doi]
• A new algorithm and improved lower bound for point placement on a line in two roundsMd. Shafiul Alam, Asish Mukhopadhyay. 229-232 [doi]
• Constrained k-center and movement to independenceAdrian Dumitrescu, Minghui Jiang. 233-236 [doi]
• Computing minimum limited-capacity matching in one-dimensional space and for the points lying on two perpendicular linesFatemeh Panahi, Ali Mohades. 237-240 [doi]
• New variations of the reverse facility location problemBhaswar B. Bhattacharya, Subhas C. Nandy. 241-244 [doi]
• I/O-efficient triangular range search and its applicationGautam K. Das, Bradford G. Nickerson. 245-248 [doi]
• Range aggregate structures for colored geometric objectsSaladi Rahul, Haritha Bellam, Prosenjit Gupta, Krishnan Rajan. 249-252 [doi]
• Fast local searches and updates in bounded universesProsenjit Bose, Karim Douïeb, Vida Dujmovic, John Howat, Pat Morin. 261-264 [doi]
• Cluster connecting problem inside a polygonSanjib Sadhu, Arijit Bishnu, Subhas C. Nandy, Partha P. Goswami. 265-268 [doi]
• Finding monochromatic l-shapes in bichromatic point setsFarnaz Sheikhi, Mark de Berg, Ali Mohades, Mansoor Davoodi Monfared. 269-272 [doi]
• On polygons excluding point setsRadoslav Fulek, Balázs Keszegh, Filip Moric, Igor Uljarevic. 273-276 [doi]
• Six-way equipartitioning by three lines in the planeWilliam Steiger, Mario Szegedy, Jihui Zhao. 277-280 [doi]