Pages that link to "Item:Q4289634"

The following pages link to APPROXIMATING POLYGONS AND SUBDIVISIONS WITH MINIMUM-LINK PATHS (Q4289634):

Displaying 31 items.

• Touring a sequence of disjoint polygons: complexity and extension (Q300225) (← links)
• Roman domination in subgraphs of grids (Q324726) (← links)
• Fitting a two-joint orthogonal chain to a point set (Q617541) (← links)
• Polygonal chain approximation: A query based approach (Q706723) (← links)
• Structured discrete shape approximation: theoretical complexity and practical algorithm (Q824342) (← links)
• Area-preserving approximations of polygonal paths (Q866543) (← links)
• Approximation of an open polygonal curve with a minimum number of circular arcs and biarcs (Q934021) (← links)
• Edges and switches, tunnels and bridges (Q1028235) (← links)
• Continuous location of dimensional structures. (Q1410321) (← links)
• Stabbing segments with rectilinear objects (Q1738129) (← links)
• An optimal algorithm for minimum-link rectilinear paths in triangulated rectilinear domains (Q1755791) (← links)
• Separation and approximation of polyhedral objects (Q1900992) (← links)
• Route-enabling graph orientation problems (Q1939659) (← links)
• New limits of treewidth-based tractability in optimization (Q2118087) (← links)
• A graph theoretical approach to the firebreak locating problem (Q2124231) (← links)
• Computing homotopic line simplification (Q2249045) (← links)
• Optimization for first order Delaunay triangulations (Q2269140) (← links)
• Polygon simplification by minimizing convex corners (Q2272403) (← links)
• Efficient observer-dependent simplification in polygonal domains (Q2428687) (← links)
• Polygonal path simplification with angle constraints (Q2571211) (← links)
• An O(n <font>log</font> n) ALGORITHM FOR FINDING A SHORTEST CENTRAL LINK SEGMENT (Q4682194) (← links)
• KINETIC COLLISION DETECTION FOR SIMPLE POLYGONS (Q4818544) (← links)
• SPACE-EFFICIENT ALGORITHMS FOR APPROXIMATING POLYGONAL CURVES IN TWO-DIMENSIONAL SPACE (Q4818576) (← links)
• Global Curve Simplification (Q5075813) (← links)
• (Q5088945) (← links)
• Constructing pairwise disjoint paths with few links (Q5096957) (← links)
• On Optimal Polyline Simplification Using the Hausdorff and Fréchet Distance (Q5115824) (← links)
• Place the Vertices Anywhere on the Curve and Simplify (Q5164876) (← links)
• Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance (Q5458565) (← links)
• Streaming algorithms for line simplification (Q5919922) (← links)
• On the computational complexity of Roman\(\{2\}\)-domination in grid graphs (Q6043333) (← links)