Pages that link to "Item:Q598549"

The following pages link to Convexity minimizes pseudo-triangulations (Q598549):

Displaying 10 items.

• On the number of crossing-free partitions (Q359753) (← links)
• Multitriangulations, pseudotriangulations and primitive sorting networks (Q443914) (← links)
• The stochastic walk algorithms for point location in pseudo-triangulations (Q634299) (← links)
• Empty pseudo-triangles in point sets (Q765318) (← links)
• Planar minimally rigid graphs and pseudo-triangulations (Q1775778) (← links)
• Enumerating pseudo-triangulations in the plane (Q1776895) (← links)
• A lower bound on the number of triangulations of planar point sets (Q1882855) (← links)
• A new lower bound on the maximum number of plane graphs using production matrices (Q2331222) (← links)
• On the number of plane geometric graphs (Q2373434) (← links)
• On the number of pseudo-triangulations of certain point sets (Q2474495) (← links)