Zobrazeno 1 - 10
of 22
pro vyhledávání: '"Clockwise order"'
Autor:
Tomoki Nakamigawa
Publikováno v:
Ars Mathematica Contemporanea. 18:381-391
A chord diagram E is a set of chords of a circle such that no pair of chords has a common endvertex. Let v 1 , v 2 , …, v 2 n be a sequence of vertices arranged in clockwise order along a circumference. A chord diagram { v 1 v n + 1 , v 2 v n + 2 ,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b117997a42f686646ea69a315587379a
https://doi.org/10.26493/1855-3974.2239.7f1
https://doi.org/10.26493/1855-3974.2239.7f1
Publikováno v:
IDC (Extended Abstracts)
How do children plan their drawing on a touchscreen? Studies have shown that children follow a certain graphic rules and routine in their drawing. We are at the start of investigating how children of different ages plan their drawing strategies on a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::985863c63142d18a276fe19d98a6dd9a
https://doi.org/10.1145/3397617.3397844
https://doi.org/10.1145/3397617.3397844
Publikováno v:
Electronic Notes in Discrete Mathematics, 68, 227-232. Elsevier
Electronic Notes in Discrete Mathematics, 68, 227-232
Electronic Notes in Discrete Mathematics, 68, 227-232
Let n and k be positive integers with n ≥ 2 k . Consider a circle C with n points 1 , … , n in clockwise order. The interlacing graph IG n , k is the graph with vertices corresponding to k-subsets of [n] that do not contain two adjacent points on
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c7238bea8e27ae898abc45ecb0c2aa4b
https://doi.org/10.1016/j.endm.2018.06.039
https://doi.org/10.1016/j.endm.2018.06.039
Autor:
Asaf Nachmias
Publikováno v:
Lecture Notes in Mathematics ISBN: 9783030279677
In this chapter we discuss countably infinite connected simple graphs that are locally finite , that is, the vertex degrees are finite. In a similar fashion to the previous chapter, an infinite planar graph is a connected infinite graph such that the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2cba0980f22757cd123629a3c9036175
https://doi.org/10.1007/978-3-030-27968-4_4
https://doi.org/10.1007/978-3-030-27968-4_4
Autor:
Mikael Olsson
Publikováno v:
CSS3 Quick Syntax Reference ISBN: 9781484249024
CSS Quick Syntax Reference Guide ISBN: 9781430264903
CSS Quick Syntax Reference Guide ISBN: 9781430264903
Margins and padding are used to adjust the position of an element and to create space around it.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::25d0c72e4bbdd0b94322339ea25e389a
https://doi.org/10.1007/978-1-4842-4903-1_19
https://doi.org/10.1007/978-1-4842-4903-1_19
Autor:
Martin Derka, Therese C. Biedl
Publikováno v:
SOFSEM 2017: Theory and Practice of Computer Science ISBN: 9783319519623
SOFSEM
SOFSEM
This paper considers 1-string representations of planar graphs that are order-preserving in the sense that the order of crossings along the curve representing vertex v is the same as the order of edges in the clockwise order around v in the planar em
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8fd22db9d1bf2be022022c81a448c06e
https://doi.org/10.1007/978-3-319-51963-0_22
https://doi.org/10.1007/978-3-319-51963-0_22
Publikováno v:
Discrete & Computational Geometry. 39:442-454
The crossing number of a graph is the minimum number of edge intersections in a plane drawing of a graph, where each intersection is counted separately. If instead we count the number of pairs of edges that intersect an odd number of times, we obtain
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::75254dea1fe80397141a2fe39e7efcae
https://doi.org/10.1007/s00454-008-9058-x
https://doi.org/10.1007/s00454-008-9058-x
Autor:
Sergey Bereg
Publikováno v:
Discrete & Computational Geometry. 34:87-96
We study the problem of computing an equitable 2-fan for three masses distributed on the 2-sphere. The existence of an equitable 2-fan was shown by Barany and Matousek. The contribution of this paper is twofold. (i) We prove the existence of an infin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bb6c4f8a8f750b02d226cd9c6360784d
https://doi.org/10.1007/s00454-004-1151-1
https://doi.org/10.1007/s00454-004-1151-1
Autor:
Patrick Adam, Helmut Breuninger
Publikováno v:
3D Histology Evaluation of Dermatologic Surgery ISBN: 9781447144373
As we have seen in the previous chapter, topographic landmarks facilitate the precise localization of tumor-positive outgrowths in the entire 3D margins. With the help of this information, the surgeon can then carry out accurate topographic resection
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cc13093e8c5afa8b2014e11dfca91a09
https://doi.org/10.1007/978-1-4471-4438-0_6
https://doi.org/10.1007/978-1-4471-4438-0_6
Autor:
Tang Fu‐Su∗
Publikováno v:
International Journal of Mathematical Education in Science and Technology. 26:581-588
In this paper we discuss the interesting problem of finding the number of possible closed hexagons which can be formed by six Tri‐Ominos from the set supplied. Even though this problem is from a game there are some important mathematical facts and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::df202bba1ab9a9f851329346447cccb1
https://doi.org/10.1080/0020739950260413
https://doi.org/10.1080/0020739950260413