The following pages link to Tetsuo Asano (Q390166):
Displaying 50 items.
- (Q197774) (redirect page) (← links)
- Reprint of: Memory-constrained algorithms for simple polygons (Q390167) (← links)
- Faster computation of the Robinson-Foulds distance between phylogenetic networks (Q454925) (← links)
- A new algorithmic framework for basic problems on binary images (Q528334) (← links)
- In-place algorithm for erasing a connected component in a binary image (Q692939) (← links)
- Optimal spanners for axis-aligned rectangles (Q706725) (← links)
- Voronoi diagrams with respect to criteria on vision information (Q946853) (← links)
- Some theoretical challenges in digital geometry: a perspective (Q967394) (← links)
- Disc covering problem with application to digital halftoning (Q970100) (← links)
- Online uniformity of integer points on a line (Q975527) (← links)
- A linear-space algorithm for distance preserving graph embedding (Q1005326) (← links)
- Generating and counting valid patterns in routes between two points (Q1080436) (← links)
- Visibility of disjoint polygons (Q1087340) (← links)
- Shortest path between two simple polygons (Q1107993) (← links)
- Space-filling curves and their use in the design of geometric data structures (Q1391294) (← links)
- Spanning trees crossing few barriers (Q1422228) (← links)
- Pseudo approximation algorithms with applications to optimal motion planning (Q1424321) (← links)
- Shattering a set of objects in 2D (Q1613422) (← links)
- Translating a convex polyhedron over monotone polyhedra (Q1862129) (← links)
- The structure and number of global roundings of a graph (Q1884844) (← links)
- Variants for the Hough transform for line detection (Q1917055) (← links)
- Transportation problem on a graph (Q2111557) (← links)
- A new transportation problem on a graph with sending and bringing-back operations (Q2232226) (← links)
- Algorithms for projecting points to give the most uniform distribution with applications to hashing (Q2366237) (← links)
- Aspect-ratio Voronoi diagram and its complexity bounds (Q2380035) (← links)
- Memory-constrained algorithms for simple polygons (Q2391542) (← links)
- A generalization of magic squares with applications to digital halftoning (Q2480747) (← links)
- (Q2708237) (← links)
- (Q2722004) (← links)
- (Q2728901) (← links)
- Time-Space Tradeoffs for All-Nearest-Larger-Neighbors Problems (Q2842143) (← links)
- Constant-Work-Space Algorithms for Shortest Paths in Trees and Simple Polygons (Q2865044) (← links)
- $\widetilde{O}(\sqrt{n})$ -Space and Polynomial-Time Algorithm for Planar Directed Graph Reachability (Q2922595) (← links)
- (Q2934662) (← links)
- Depth-First Search Using $$O(n)$$ Bits (Q2942660) (← links)
- (Q2968076) (← links)
- Constant-Work-Space Image Scan with a Given Angle (Q3000469) (← links)
- In-Place Linear-Time Algorithms for Euclidean Distance Transform (Q3052776) (← links)
- The Structure and Number of Global Roundings of a Graph (Q3082920) (← links)
- (Q3084820) (← links)
- Constant-Work-Space Algorithm for a Shortest Path in a Simple Polygon (Q3404425) (← links)
- Zone Diagrams: Existence, Uniqueness, and Algorithmic Challenge (Q3519393) (← links)
- Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks (Q3575247) (← links)
- Constant-Working-Space Algorithms: How Fast Can We Solve Problems without Using Any Extra Array? (Q3596699) (← links)
- CONSTRUCTING OPTIMAL HIGHWAYS (Q3620612) (← links)
- (Q3625837) (← links)
- Finding Nearest Larger Neighbors (Q3644726) (← links)
- (Q3689213) (← links)
- Polygon triangulation: Efficiency and minimality (Q3742737) (← links)
- (Q3787490) (← links)
