Quasi-Configurations Derived by Special Arrangements of Lines

Autor: Stefano Innamorati

Publikováno v: Axioms, Vol 13, Iss 5, p 321 (2024)

A quasi-configuration is a point–line incidence structure in which each point is incident with at least three lines and each line is incident with at least three points. We investigate derived quasi-configurations that arise both by duality and int

Externí odkaz: https://doaj.org/article/7ee552c267a1435ca932c1c938ac4899

Time- and Space-Efficient Algorithms for Least Median of Squares Regression

Autor: Souvaine, Diane L., Steele, J. Michael

Publikováno v: Journal of the American Statistical Association, 1987 Sep 01. 82(399), 794-801.

Externí odkaz: https://www.jstor.org/stable/2288788

Inserting One Edge into a Simple Drawing Is Hard

Autor: Arroyo, Alan, Klute, Fabian, Parada, Irene, Seidel, Raimund, Vogtenhuber, Birgit, Wiedera, Tilo, Sub Geometric Computing, Geometric Computing

Publikováno v: 46th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'20), 12301, 325. Springer
Graph-Theoretic Concepts in Computer Science ISBN: 9783030604394
WG

A simple drawing D(G) of a graph G is one where each pair of edges share at most one point: either a common endpoint or a proper crossing. An edge e in the complement of G can be inserted into D(G) if there exists a simple drawing of \(G+e\) extendin

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a295b2322371ce2325fe452a7e0f7ee1
https://dspace.library.uu.nl/handle/1874/414872

Labeling nonograms: Boundary labeling for curve arrangements

Autor: Martin Nöllenburg, Maarten Löffler, Fabian Klute

Publikováno v: Computational Geometry. 98:101791

Slanted and curved nonograms are a new type of picture puzzles introduced by Van de Kerkhof et al. (2019). They consist of an arrangement of lines or curves within a frame B, where some of the cells need to be colored in order to obtain the solution

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::88bcf35de36baacc5d1b607c8891b03f
https://doi.org/10.1016/j.comgeo.2021.101791

Layer-by-layer growth of vertex graph of Penrose tiling

Autor: A. V. Maleev, A. V. Shutov

Publikováno v: Crystallography Reports. 62:683-691

The growth form for the vertex graph of Penrose tiling is found to be a regular decagon. The lower and upper bounds for this form, coinciding with it, are strictly proven. A fractal character of layer-by-layer growth is revealed for some subgraphs of

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::e5b6fa1e8196239cd94294f5e664372d
https://doi.org/10.1134/s1063774517050194