The following pages link to Greg Aloupis (Q390137):
Displaying 42 items.
- Triangulating and guarding realistic polygons (Q390140) (← links)
- Draining a polygon-or-rolling a ball out of a polygon (Q390145) (← links)
- Decomposition of multiple coverings into more parts (Q603854) (← links)
- Colorful strips (Q659707) (← links)
- Bottleneck detour tree of points on a path (Q670710) (← links)
- Non-crossing matchings of points with geometric objects (Q714905) (← links)
- Reconfiguring triangulations with edge flips and point moves (Q879960) (← links)
- Compatible connectivity augmentation of planar disconnected graphs (Q894688) (← links)
- Linear reconfiguration of cube-style modular robots (Q924084) (← links)
- Coloring geometric range spaces (Q1017922) (← links)
- Highway hull revisited (Q1037778) (← links)
- A lower bound for computing Oja depth (Q1044726) (← links)
- Algorithms for bivariate medians and a Fermat-Torricelli problem for lines. (Q1395576) (← links)
- Lower bounds for computing statistical depth. (Q1608898) (← links)
- Recognizing weakly simple polygons (Q1688854) (← links)
- More classes of stuck unknotted hexagons (Q1878947) (← links)
- Establishing strong connectivity using optimal radius half-disk antennas (Q1931278) (← links)
- Computing colourful simplicial depth and Median in \(\mathbb{R}_2\) (Q2135626) (← links)
- Isoperimetric enclosures (Q2345509) (← links)
- Classic Nintendo games are (computationally) hard (Q2347007) (← links)
- Bichromatic compatible matchings (Q2354926) (← links)
- Efficient reconfiguration of lattice-based modular robots (Q2391539) (← links)
- Edge-unfolding nested polyhedral bands (Q2456664) (← links)
- Blocking Colored Point Sets (Q2849797) (← links)
- Fitting Voronoi Diagrams to Planar Tesselations (Q2870041) (← links)
- COMPUTING SIGNED PERMUTATIONS OF POLYGONS (Q3007725) (← links)
- Realistic Reconfiguration of Crystalline (and Telecube) Robots (Q3079494) (← links)
- Common Unfoldings of Polyominoes and Polycubes (Q3098067) (← links)
- Recognizing weakly simple polygons (Q3132840) (← links)
- Colorful Strips (Q3557004) (← links)
- Matching Points with Things (Q3557040) (← links)
- Reconfiguration of Cube-Style Modular Robots Using O(logn) Parallel Moves (Q3596731) (← links)
- (Q4427858) (← links)
- (Q4633837) (← links)
- Meshes Preserving Minimum Feature Size (Q4899286) (← links)
- Bichromatic compatible matchings (Q5174487) (← links)
- Compatible Connectivity-Augmentation of Planar Disconnected Graphs (Q5363015) (← links)
- The Complexity of Order Type Isomorphism (Q5383989) (← links)
- Linear Reconfiguration of Cube-Style Modular Robots (Q5387758) (← links)
- Coloring Geometric Range Spaces (Q5458524) (← links)
- Graph Drawing (Q5711592) (← links)
- The complexity of order type isomorphism (Q6624165) (← links)
