Greg Aloupis

According to our database1, Greg Aloupis authored at least 49 papers between 2002 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
The Complexity of Order Type Isomorphism.
Discret. Comput. Geom., September, 2024

Noncrossing Longest Paths and Cycles.
Proceedings of the 32nd International Symposium on Graph Drawing and Network Visualization, 2024

2022
Computing Colourful Simplicial Depth and Median in ℝ<sub>2</sub>.
Theory Comput. Syst., 2022

2019
Bottleneck detour tree of points on a path.
Comput. Geom., 2019

2017
Recognizing Weakly Simple Polygons.
Discret. Comput. Geom., 2017

2015
Classic Nintendo games are (computationally) hard.
Theor. Comput. Sci., 2015

Isoperimetric Enclosures.
Graphs Comb., 2015

Compatible Connectivity Augmentation of Planar Disconnected Graphs.
Discret. Comput. Geom., 2015

Bichromatic compatible matchings.
Comput. Geom., 2015

2014
Covering Folded Shapes.
J. Comput. Geom., 2014

Draining a polygon - or - rolling a ball out of a polygon.
Comput. Geom., 2014

Triangulating and guarding realistic polygons.
Comput. Geom., 2014

Editorial.
Comput. Geom., 2014

2013
The Complexity of Order Type Isomorphism.
CoRR, 2013

Establishing strong connectivity using optimal radius half-disk antennas.
Comput. Geom., 2013

Non-crossing matchings of points with geometric objects.
Comput. Geom., 2013

Efficient reconfiguration of lattice-based modular robots.
Comput. Geom., 2013

Fitting Voronoi Diagrams to Planar Tesselations.
Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

2012
Classic Nintendo Games are (NP-)Hard
CoRR, 2012

Circle Separability Queries in Logarithmic Time.
Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

Covering Points with Disjoint Unit Disks.
Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

2011
Efficient constant-velocity reconfiguration of crystalline robots.
Robotica, 2011

Computing Signed Permutations of Polygons.
Int. J. Comput. Geom. Appl., 2011

Colorful Strips.
Graphs Comb., 2011

Meshes Preserving Minimum Feature Size.
Proceedings of the Computational Geometry - XIV Spanish Meeting on Computational Geometry, 2011

Convexifying Polygons Without Losing Visibilities.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010
Decomposition of Multiple Coverings into More Parts.
Discret. Comput. Geom., 2010

Highway hull revisited.
Comput. Geom., 2010


Common Unfoldings of Polyominoes and Polycubes.
Proceedings of the Computational Geometry, Graphs and Applications, 2010

2009
Coloring Geometric Range Spaces.
Discret. Comput. Geom., 2009

Minimum feature size preserving decompositions
CoRR, 2009

Detecting all regular polygons in a point set
CoRR, 2009

Reconfiguration of 3D Crystalline Robots Using O(log n) Parallel Moves
CoRR, 2009

Linear reconfiguration of cube-style modular robots.
Comput. Geom., 2009

2008
Edge-unfolding nested polyhedral bands.
Comput. Geom., 2008

Realistic Reconfiguration of Crystalline (and Telecube) Robots.
Proceedings of the Algorithmic Foundation of Robotics VIII, 2008

Reconfiguration of Cube-Style Modular Robots Using O(logn) Parallel Moves.
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

2007
Reconfiguring Triangulations with Edge Flips and Point Moves.
Algorithmica, 2007

Vertex Pops and Popturns.
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

2006
Algorithms for Computing Geometric Measures of Melodic Similarity.
Comput. Music. J., 2006

LUMINESStrategies.
Proceedings of the Computers and Games, 5th International Conference, 2006

2005
A lower bound for computing Oja depth.
Inf. Process. Lett., 2005

2004
Unfolding polyhedral bands.
Proceedings of the 16th Canadian Conference on Computational Geometry, 2004

2003
Algorithms for bivariate medians and a Fermat-Torricelli problem for lines.
Comput. Geom., 2003

Geometric measures of data depth.
Proceedings of the Data Depth: Robust Multivariate Analysis, 2003

Computing the Similarity of two Melodies.
Proceedings of the 15th Canadian Conference on Computational Geometry, 2003

2002
Flat-State Connectivity of Linkages under Dihedral Motions.
Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

On flat-state connectivity of chains with fixed acute angles.
Proceedings of the 14th Canadian Conference on Computational Geometry, 2002


  Loading...