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)
- 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)
- RECONSTRUCTING CONVEX POLYGONS AND CONVEX POLYHEDRA FROM EDGE AND FACE COUNTS IN ORTHOGONAL PROJECTIONS (Q2999095) (← links)
- GUARDING ORTHOGONAL ART GALLERIES WITH SLIDING CAMERAS (Q2999096) (← links)
- EXISTENCE AND COMPUTATION OF TOURS THROUGH IMPRECISE POINTS (Q3007721) (← links)
- ON COMPUTING ENCLOSING ISOSCELES TRIANGLES AND RELATED PROBLEMS (Q3007722) (← links)
- COMPUTATIONAL AND STRUCTURAL ADVANTAGES OF CIRCULAR BOUNDARY REPRESENTATION (Q3007723) (← links)
- COMPUTING NICE PROJECTIONS OF CONVEX POLYHEDRA (Q3007724) (← links)
- COMPUTING SIGNED PERMUTATIONS OF POLYGONS (Q3007725) (← links)
- A COMPLETE ALGORITHM FOR SEARCHLIGHT SCHEDULING (Q3007726) (← links)
- A COVERING PROJECTION FOR ROBOT NAVIGATION UNDER STRONG ANISOTROPY (Q3063652) (← links)
- BALANCED SUBDIVISIONS WITH BOUNDARY CONDITION OF TWO SETS OF POINTS IN THE PLANE (Q3063653) (← links)
- SCALE SELECTION FOR GEOMETRIC FITTING IN NOISY POINT CLOUDS (Q3063656) (← links)
- CONSTRAINED POINT-SET EMBEDDABILITY OF PLANAR GRAPHS (Q3063657) (← links)
- LOCATING GUARDS FOR VISIBILITY COVERAGE OF POLYGONS (Q3063659) (← links)
- RECONCILING CONFLICTING COMBINATORIAL PREPROCESSORS FOR GEOMETRIC CONSTRAINT SYSTEMS (Q3070041) (← links)
- MULTIDIMENSIONAL ONLINE MOTION PLANNING FOR A SPHERICAL ROBOT (Q3070042) (← links)
- OPERATIONS PRESERVING GLOBAL RIGIDITY OF GENERIC DIRECTION-LENGTH FRAMEWORKS (Q3070043) (← links)
- PARETO ENVELOPES IN SIMPLE POLYGONS (Q3070044) (← links)
- FRAMEWORKS SYMMETRY AND RIGIDITY (Q3070045) (← links)
- DETECTING COMMUTING PATTERNS BY CLUSTERING SUBTRAJECTORIES (Q3089091) (← links)
- MINKOWSKI SUM SELECTION AND FINDING (Q3089093) (← links)
- COVERING A POINT SET BY TWO DISJOINT RECTANGLES (Q3089094) (← links)
- GREEDY CONSTRUCTION OF 2-APPROXIMATE MINIMUM MANHATTAN NETWORKS (Q3089095) (← links)
- INDUCING POLYGONS OF LINE ARRANGEMENTS (Q3089096) (← links)
- APPROXIMATE NEAREST NEIGHBOR SEARCH UNDER TRANSLATION INVARIANT HAUSDORFF DISTANCE (Q3089097) (← links)
- CORRECTNESS PROOF OF A GEOMETRIC CONSTRAINT SOLVER (Q3126153) (← links)
- CONSTRAINTS ON SIMPLE GEOMETRY IN TWO AND THREE DIMENSIONS (Q3126154) (← links)
- CONSTRAINING A QUADRATIC RATIONAL BEZIER TO BE AN ELLIPTICAL ARC (Q3126155) (← links)
- EVALUATING GEOMETRIC SENSITIVITIES AT SINGULAR AND NON-SINGULAR POINTS OF VARIATIONAL CAD MODELS FOR DESIGN OPTIMIZATION (Q3126156) (← links)
