Pages that link to "Item:Q4721658"

The following pages link to Sorting jordan sequences in linear time using level-linked search trees (Q4721658):

Displaying 44 items.

• Efficient on-line algorithms for Euler diagram region computation (Q709068) (← links)
• Partitioning the meandering curves (Q748760) (← links)
• A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons (Q809630) (← links)
• Computational geometry in a curved world (Q911324) (← links)
• Simplified linear-time Jordan sorting and polygon clipping (Q911762) (← links)
• Meander, folding, and arch statistics (Q967953) (← links)
• Reprint of: A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons (Q982944) (← links)
• Clamshell casting (Q1031870) (← links)
• On-line sorting of twisted sequences in linear time (Q1104753) (← links)
• Decomposition and intersection of simple splinegons (Q1105375) (← links)
• Scaffold permutations (Q1117929) (← links)
• Triangulating a simple polygon in linear time (Q1176324) (← links)
• Arrangements of curves in the plane --- topology, combinatorics, and algorithms (Q1185003) (← links)
• Polygon triangulation in \(O(n\log{}\log{}n)\) time with simple data structures (Q1189285) (← links)
• A partial order for the set of meanders (Q1272359) (← links)
• Cartographic line simplification and polygon CSG formulae in \(O(n\log^* n)\) time (Q1276944) (← links)
• A new algorithm for Jordan sorting: Its average-case analysis (Q1289031) (← links)
• A workbench for computational geometry (Q1322571) (← links)
• Meanders and the Temperley-Lieb algebra (Q1360563) (← links)
• Erased arrangements of linear and convex decompositions of polyhedra (Q1384196) (← links)
• Meanders: Exact asymptotics (Q1572530) (← links)
• An optimal algorithm for minimum-link rectilinear paths in triangulated rectilinear domains (Q1755791) (← links)
• Topologically sweeping visibility complexes via pseudotriangulations (Q1816465) (← links)
• Meanders: A direct enumeration approach (Q1816788) (← links)
• A fast Las Vegas algorithm for triangulating a simple polygon (Q1823686) (← links)
• Translating a convex polyhedron over monotone polyhedra (Q1862129) (← links)
• Randomized search trees (Q1923861) (← links)
• Improved bounds for finger search on a RAM (Q1950391) (← links)
• Computing the \(k\)-visibility region of a point in a polygon (Q2032289) (← links)
• Finding and counting permutations via CSPs (Q2041985) (← links)
• Interval-based temporal functional dependencies: specification and verification (Q2251126) (← links)
• Three problems about simple polygons (Q2432735) (← links)
• A linear time algorithm to remove winding of a simple polygon (Q2489541) (← links)
• Placing Text Boxes on Graphs (Q3611861) (← links)
• SU(N) meander determinants (Q4378332) (← links)
• Decision Trees for Geometric Models (Q4513214) (← links)
• Nested Sets of Pairs (Q4718610) (← links)
• TOPOLOGICAL PEELING AND APPLICATIONS (Q4818578) (← links)
• GOOD NEWS: PARTITIONING A SIMPLE POLYGON BY COMPASS DIRECTIONS (Q4824657) (← links)
• Cartographic line simplication and polygon CSG formulae in O(n log* n) time (Q5096928) (← links)
• Linear-Time Algorithm for Long LCF with k Mismatches (Q5140788) (← links)
• Optimal finger search trees in the pointer machine (Q5917584) (← links)
• Exact meander asymptotics: a numerical check (Q5934908) (← links)
• Meanders: a personal perspective to the memory of Pierre Rosenstiehl (Q6564001) (← links)