|
Asish Mukhopadhyay, Eugene Greene and Dulon Roy Chowdhury. On the
All-Farthest-Triangles Problem for a Set of Points in 3d
|
|
Jin-ichi Itoh, Joseph O'Rourke and Costin Vilcu. Unfolding Convex Polyhedra via
Quasigeodesics: Abstract
|
|
Atlas
F. Cook IV and Carola
Wenk. Geodesic
Fréchet Distance Inside a Simple Polygon
|
|
Maharaj Mukherjee and Kanad Chakraborty. Efficient Algorithms for Rectangular
Packing and Pattern Fill Problem
|
|
Amiya R. Satapathy, Maharaj Mukherjee and Sudebkumar Pal.
Accessibility problems
for robotic arms with multiple stretchable links
|
|
Guy
Even, Retsef Levi,
Dror Rawitz,
Baruch Schieber, Moni
Shahar and Maxim Sviridenko. Algorithms for Capacitated Rectangle
Stabbing and Lot Sizing with Joint Set-Up Costs
|
|
Oswin Aichholzer, Sergey Bereg, Adrian Dumitrescu,
Alfredo Garcia, Clemens Huemer, Ferran
Hurtado, Mikio Kano, Alberto Marquez, Shakhar Smorodinsky, Diane Souvaine, Jorge
Urrutia and David Wood.
Compatible Geometric
Matchings
|
|
Jonathan Lenchner. Ordinary Points in Polygons
|
|
Ovidiu
Daescu and Yam Ki Cheung. Point to face shortest paths in R3
|
|
Todd
Phillips, Gary
Miller and Benoit Hudson. Size Complexity of Volume Meshes vs.
Surface Meshes
|
|
S. Damla Ahipasaoglu and Michael J. Todd. Minimum Area Enclosing Ellipsoidal
Cylinder Problem
|
|
Adrian
Dumitrescu and Csaba Toth. Analysis of two sweep-line algorithms
for spanning trees and Steiner trees
|
|
Paolo Codenotti and Pedro Felzenszwalb. 2D Min-Filters with Polygons
|
|
Megan
Owen. Linear Algorithm
for Shortest Path Through Select Orthants
|
|
Iyad Kanj,
Ljubomir Perkovic and Ge Xia. An Optimal Localized Approximation
Scheme for Euclidean MST
|
|
Grzegorz Swirszcz and Tomasz Maszczyk. Some remarks on Origami and its
limitations
|
|
Jonathan Backer and David Kirkpatrick. An Approximation Algorithm for General
Minimum-Length Bounded-Curvature Paths
|
|
Diego R. Llanos, David Orden and Belen Palop. Parallelizing non-parallelizable
geometric algorithms
|
|
Maarten Löffler and Elena Mumford. Rotating Rectilinear Graphs
|
|
Florian Berger, Ansgar
Gruene and Rolf Klein. How many lions can one man avoid?
|
|
Ovidiu
Daescu and Anastasia Kurdia. Recognizing minimally rigid graphs in
the plane in subquadratic time
|
|
Jonathan Muckell, Marcus A. Andrade and W Randolph Franklin. Drainage Network and
Watershed Reconstruction on Simplified Terrain
|
|
Michael Connor and Piyush Kumar. Implementing a Parallel Dynamic Approximate
Nearest Neighbor Search Algorithm
|
|
Evanthia Papadopoulou. Higher Order Voronoi diagrams of
segments for VLSI critical area extraction
|
|
Zhongyi
Xie, Marcus A. Andrade, W
Randolph Franklin, Barbara
Cutler, Metin Inanc,
Dan Tracy and Jonathan Muckell. Approximating Terrain with
Over-determined Laplacian PDEs
|
|
Mirela Damian, Robin Flatland, Joseph O'Rourke and Suneeta Ramaswami.
A New Lower Bound on
Guard Placement for Wireless Localization
|
|
Mirela Damian, Robin Flatland, Joseph O'Rourke and Suneeta Ramaswami.
Connecting
Polygonizations via Stretches and Twangs
|
|
Sebastien Collette, Vida Dujmovic, John Iacono, Stefan Langerman and Pat Morin. Distribution-Sensitive
Point Location in Convex Subdivisions
|
|
Xianjin
Zhu, Rik Sarkar,
Jie Gao and Joseph
Mitchell. Light-weight
Contour Tracking in Wireless Sensor Networks
|
|
V Anuradha , Chinmay
Jain, Jack
Snoeyink and Tibor Szabo. How long can a graph be kept planar?
|
|
Vishal Verma and Jack Snoeyink. Upending a sphere
|
|
Eli
Packer. Computing
Multiple Watchmen Routes
|
|
Joseph
Mitchell and Eli
Packer. Computing
Geometric Structures of Low Stabbing Number in the Plane
|
|
Ileana
Streinu and Louis
Theran. Algorithms
for area and volume rigidity
|
|
Mustaq
Ahmed and Anna
Lubiw. Properties
of Shortest Descending Paths
|
|
Jeff Erickson and Pratik Worah. Computing the shortest essential cycle
|
|
Rik
Sarkar, Xianjin
Zhu, Jie Gao, Leonidas Guibas and Joseph Mitchell. Iso-Contour Queries and
Gradient Routing with Guaranteed Delivery in Sensor Networks
|
|
Amotz Bar-Noy, Theodore Brown, Matthew P. Johnson and Ou
Liu. Covering With
Inexactly Placed Sensors
|
|
Robert
N. Lass, Michael J. Grauer, Evan A. Sultanik and William C. Regli. A Decentralized Approach to the Art
Gallery Problem
|
|
Erin
Chambers, Jeff Erickson and Pratik Worah. Testing Contractibility in Planar Rips
Complexes
|
|
Erin
Chambers, ïric Colin
de Verdiïre, Jeff Erickson, Sylvain Lazard, Francis Lazarus and Shripad Thite. Walking Your Dog in the
Woods in Polynomial Time
|
|
Audrey
Lee and Louis Theran.
Analyzing Rigidity
with Pebble Games
|
|
John Hugg and Diane Souvaine. Research Tools for Data Depth
|