scientific article; zbMATH DE number 5506218

MaRDI QIDQ3601549zbMATH OpenFDO

Authors Micha Sharir, Emo Welzl

Publication date 10 February 2009

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cited in

(15)

• On numbers of pseudo-triangulations
• Minimum number of partial triangulations
• Random lattice triangulations: structure and algorithms
• On the number of plane geometric graphs
• Counting plane graphs with exponential speed-up
• Reducing urban concentration using a neural network model
• A Census of Plane Graphs with Polyline Edges
• Number of crossing-free geometric graphs vs. Triangulations
• On degrees in random triangulations of point sets
• On the number of higher order Delaunay triangulations
• Interview with Micha Sharir
• On the number of drawings of a combinatorial triangulation
• Chains, Koch chains, and point sets with many triangulations
• Flips in planar graphs
• A model to simplify 2D triangle meshes with irregular shapes

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3601549)