AbstractWe give a short proof of the contractibility of the space of geodesic triangulations with fixed combinatorial type of a convex polygon in the Euclidean plane. Moreover, for any $$n>0$$
n
>
0
, we show that there exists a space of geodesic triangulations of a polygon with a triangulation, whose n-th homotopy group is not trivial.
AbstractWe introduce a greedy algorithm optimizing arrangements of lines with respect to a property. We apply this algorithm to the case of simpliciality: it recovers all known simplicial arrangements of lines in a very short time and also produces a yet unknown simplicial arrangement with 35 lines. We compute a (certainly incomplete) database of combinatorially simplicial complex arrangements of hyperplanes with up to 50 lines. Surprisingly, it contains several examples whose matroids have an infinite space of realizations up to projectivities.