Pages that link to "Item:Q96577"
From MaRDI portal
The following pages link to International Journal of Computational Geometry & Applications (Q96577):
Displaying 50 items.
- A RANDOMIZED ALGORITHM FOR SLOPE SELECTION (Q96581) (← links)
- THE THREE-PHASE METHOD: A UNIFIED APPROACH TO ORTHOGONAL GRAPH DRAWING (Q2708038) (← links)
- OBNOXIOUS FACILITY LOCATION: COMPLETE SERVICE WITH MINIMAL HARM (Q2708039) (← links)
- QUANTILE APPROXIMATION FOR ROBUST STATISTICAL ESTIMATION AND k-ENCLOSING PROBLEMS (Q2708040) (← links)
- EQUIVALENCE OF TOPOLOGICAL FORM FOR CURVILINEAR GEOMETRIC OBJECTS (Q2708041) (← links)
- DRAWING DIRECTED ACYCLIC GRAPHS: AN EXPERIMENTAL STUDY (Q2708043) (← links)
- COMPUTATIONAL GEOMETRY COLUMN 40 (Q2708044) (← links)
- A Bottleneck Matching Problem with Edge-Crossing Constraints (Q2792796) (← links)
- Placing Two Axis-Parallel Squares to Maximize the Number of Enclosed Points (Q2792797) (← links)
- 3-Colorability of Pseudo-Triangulations (Q2792798) (← links)
- An Upper Bound on the k-Modem Illumination Problem (Q2792799) (← links)
- Point Visibility Graph Recognition is NP-Hard (Q2809312) (← links)
- More Flexible Curve Matching via the Partial Fréchet Similarity (Q2809313) (← links)
- Fréchet Similarity of Closed Polygonal Curves (Q2809314) (← links)
- Selection Lemmas for Various Geometric Objects (Q2828788) (← links)
- 3-Colored Triangulation of 2D Maps (Q2828790) (← links)
- EDITOR'S FOREWORD (Q2875642) (← links)
- IMPROVED POINTER MACHINE AND I/O LOWER BOUNDS FOR SIMPLEX RANGE REPORTING AND RELATED PROBLEMS (Q2875643) (← links)
- APPROXIMATE BREGMAN NEAR NEIGHBORS IN SUBLINEAR TIME: BEYOND THE TRIANGLE INEQUALITY (Q2875644) (← links)
- THE STABILITY OF DELAUNAY TRIANGULATIONS (Q2875645) (← links)
- FINDING THE LARGEST EMPTY DISK CONTAINING A QUERY POINT (Q2875646) (← links)
- THE POINT-SET EMBEDDABILITY PROBLEM FOR PLANE GRAPHS (Q2875647) (← links)
- AN ORACLE-BASED, OUTPUT-SENSITIVE ALGORITHM FOR PROJECTIONS OF RESULTANT POLYTOPES (Q2875648) (← links)
- STOKER'S THEOREM FOR ORTHOGONAL POLYHEDRA (Q2893454) (← links)
- CATALOG-BASED REPRESENTATION OF 2D TRIANGULATIONS (Q2893456) (← links)
- INFLATING BALLS IS NP-HARD (Q2893458) (← links)
- SIMPLIPOLY: CURVATURE-BASED POLYGONAL CURVE SIMPLIFICATION (Q2893461) (← links)
- SHORTEST DESCENDING PATHS: TOWARDS AN EXACT ALGORITHM (Q2893462) (← links)
- EXTENDING THE <i>DOUBLY LINKED FACE LIST</i> FOR THE REPRESENTATION OF 2-PSEUDOMANIFOLDS AND 2-MANIFOLDS WITH BOUNDARIES (Q2893465) (← links)
- ALGORITHMS FOR DISTANCE PROBLEMS IN PLANAR COMPLEXES OF GLOBAL NONPOSITIVE CURVATURE (Q2931158) (← links)
- A UNISTABLE POLYHEDRON WITH 14 FACES (Q2931160) (← links)
- TOPOLOGY-PRESERVING WATERMARKING OF VECTOR GRAPHICS (Q2931162) (← links)
- ROBUST NONPARAMETRIC SIMPLIFICATION OF POLYGONAL CHAINS (Q2932518) (← links)
- ON THE FARTHEST LINE-SEGMENT VORONOI DIAGRAM (Q2932519) (← links)
- APPROXIMATION ALGORITHMS FOR A VARIANT OF DISCRETE PIERCING SET PROBLEM FOR UNIT DISKS (Q2932520) (← links)
- THE UNIFORM ORIENTATION STEINER TREE PROBLEM IS NP-HARD (Q2939916) (← links)
- COMPUTING <i>k</i> CENTERS OVER STREAMING DATA FOR SMALL <i>k</i> (Q2939917) (← links)
- DELAUNAY STABILITY VIA PERTURBATIONS (Q2939918) (← links)
- HARDNESS RESULTS FOR COMPUTING OPTIMAL LOCALLY GABRIEL GRAPHS (Q2939919) (← links)
- Is It FPT to Cover Points with Tours on Minimum Number of Bends (Errata)? (Q2950590) (← links)
- Algorithms for Necklace Maps (Q2950591) (← links)
- Optimization of Subdivision Invariant Tetrahedra (Q2950592) (← links)
- Aggregate-MAX Top-<i>k</i> Nearest Neighbor Searching in the <i>L</i><sub>1</sub> Plane (Q2950594) (← links)
- On the Most Likely Voronoi Diagram and Nearest Neighbor Searching (Q2988722) (← links)
- Reconstructing Point Set Order Types from Radial Orderings (Q2988723) (← links)
- Line-Constrained k-Median, k-Means, and k-Center Problems in the Plane (Q2988724) (← links)
- ASYMPTOTICALLY OPTIMAL KINODYNAMIC MOTION PLANNING FOR A CLASS OF MODULAR SELF-RECONFIGURABLE ROBOTS (Q2999090) (← links)
- THE ALIGNED K-CENTER PROBLEM (Q2999091) (← links)
- REVERSE NEAREST NEIGHBOR QUERIES IN FIXED DIMENSION (Q2999092) (← links)
- FPT-ALGORITHMS FOR MINIMUM-BENDS TOURS (Q2999094) (← links)
