Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Fekete, S��ndor P."'
We give an overview of the 2022 Computational Geometry Challenge targeting the problem Minimum Partition into Plane Subsets, which consists of partitioning a given set of line segments into a minimum number of non-crossing subsets.
13 pages, 5 f
13 pages, 5 f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::519a669cf2808ab2dfe98cae7b2909dd
http://arxiv.org/abs/2203.07444
http://arxiv.org/abs/2203.07444
Autor:
Fekete, S��ndor P., Keldenich, Phillip, Kosfeld, Ramin, Rieck, Christian, Scheffer, Christian
We consider the problem of coordinated motion planning for a swarm of simple, identical robots: From a given start grid configuration of robots, we need to reach a desired target configuration via a sequence of parallel, continuous, collision-free ro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8da16d314a1883da1013a4d7871dcefe
Autor:
Fekete, S��ndor P., Haas, Andreas, Hemmer, Michael, Hoffmann, Michael, Kostitsyna, Irina, Krupke, Dominik, Maurer, Florian, Mitchell, Joseph S. B., Schmidt, Arne, Schmidt, Christiane, Troegel, Julian
Publikováno v:
Journal of Computational Geometry, 8 (1)
Journal of Computational Geometry, 8(1), 340-365. Macodrum library, Carleton University
Journal of Computational Geometry, 8(1), 340-365. Macodrum library, Carleton University
We consider the Minimum Perimeter Polygon Problem (MP3): for a given set V of points in the plane, find a polygon P with holes that has vertex set V , such that the total boundary length is smallest possible. The MP3 can be considered a natural geome
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c1ca42c4d57d6b315c977bb760489111
https://research.tue.nl/en/publications/788095af-337d-49cf-9c42-b595bd4f5dcf
https://research.tue.nl/en/publications/788095af-337d-49cf-9c42-b595bd4f5dcf
We consider the online problem of packing circles into a square container. A sequence of circles has to be packed one at a time, without knowledge of the following incoming circles and without moving previously packed circles. We present an algorithm
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4f5af858f8590c21a3ad237cc9b5aae2
http://arxiv.org/abs/1905.00612
http://arxiv.org/abs/1905.00612
Autor:
Fekete, S��ndor P., Krupke, Dominik
We investigate a variety of problems of finding tours and cycle covers with minimum turn cost. Questions of this type have been studied in the past, with complexity and approximation results as well as open problems dating back to work by Arkin et al
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::275f80f525d272b6927b45e1409a71bd
http://arxiv.org/abs/1808.04417
http://arxiv.org/abs/1808.04417
Autor:
Fekete, S��ndor P., von H��veling, Sven, Mitchell, Joseph S. B., Rieck, Christian, Scheffer, Christian, Schmidt, Arne, Zuber, James R.
We consider dynamic loading and unloading problems for heavy geometric objects. The challenge is to maintain balanced configurations at all times: minimize the maximal motion of the overall center of gravity. While this problem has been studied from
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::654c7c91a5ac093fbe398d784ace5bb4
http://arxiv.org/abs/1712.06498
http://arxiv.org/abs/1712.06498
Autor:
Anderson, Edward J., Fekete, S´ndor P.
Publikováno v:
Operations Research. Jan/Feb2001, Vol. 49 Issue 1, p107. 12p. 5 Diagrams, 1 Chart, 1 Graph.
We introduce a new model of algorithmic tile self-assembly called size-dependent assembly. In previous models, supertiles are stable when the total strength of the bonds between any two halves exceeds some constant temperature. In this model, this co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::85ce1afe4eda74569ea63306180482be
http://arxiv.org/abs/1509.06898
http://arxiv.org/abs/1509.06898
In the original Art Gallery Problem (AGP), one seeks the minimum number of guards required to cover a polygon $P$. We consider the Chromatic AGP (CAGP), where the guards are colored. As long as $P$ is completely covered, the number of guards does not
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cbb07e43686efc07adb80b738826a169
http://arxiv.org/abs/1403.2972
http://arxiv.org/abs/1403.2972
Autor:
Fekete, S��ndor P.
In 1991, Edelsbrunner and Tan gave an O(n^2) algorithm for finding the MinMax Length triangulation of a set of points in the plane. In this paper we resolve one of the open problems stated in that paper, by showing that finding a MaxMin Length triang
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8c6757e626835108cc67a399a46bedea
http://arxiv.org/abs/1208.0202
http://arxiv.org/abs/1208.0202