Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Schrijvers, O.J."'
Autor:
Buchin, K., Devillers, O., Mulzer, W., Schrijvers, O.J., Shewchuk, J., Bodlaender, H.L., Italiano, G.F.
Publikováno v:
Proceedings of the 21st European Symposium on Algorithms
Proceedings of the 21st European Symposium on Algorithms, 2013, Sophia Antipolis, France. pp.253-264, ⟨10.1007/978-3-642-40450-4_22⟩
Symposium on Theory of Computing
ACM. Symposium on Theory of Computing, 2013, Palo Alto, United States. 2013
Lecture Notes in Computer Science ISBN: 9783642404498
ESA
Algorithms – ESA 2013 (21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013. Proceedings), 253-264
STARTPAGE=253;ENDPAGE=264;TITLE=Algorithms – ESA 2013 (21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013. Proceedings)
Proceedings of the 21st European Symposium on Algorithms, 2013, Sophia Antipolis, France. pp.253-264, ⟨10.1007/978-3-642-40450-4_22⟩
Symposium on Theory of Computing
ACM. Symposium on Theory of Computing, 2013, Palo Alto, United States. 2013
Lecture Notes in Computer Science ISBN: 9783642404498
ESA
Algorithms – ESA 2013 (21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013. Proceedings), 253-264
STARTPAGE=253;ENDPAGE=264;TITLE=Algorithms – ESA 2013 (21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013. Proceedings)
We show how to delete a vertex q from a three-dimensional Delaunay triangulation DT(S) in expected O(C¿¿¿(P)) time, where P is the set of vertices neighboring q in DT(S) and C¿¿¿(P) is an upper bound on the expected number of tetrahedra whose c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::93c10aa9bf3759e9200aca5fa62630db
https://hal.inria.fr/hal-00832992/document
https://hal.inria.fr/hal-00832992/document
Autor:
Milea, T.Y., Schrijvers, O.J., Buchin, K., Haverkort, H.J., Kreveld, van, M.J., Speckmann, B.
Publikováno v:
Graph Drawing ISBN: 9783642258770
Graph Drawing
Graph Drawing (19th International Symposium, GD 2011, Eindhoven, The Netherlands, September 21-23, 2011. Revised Selected Papers), 445-446
STARTPAGE=445;ENDPAGE=446;TITLE=Graph Drawing (19th International Symposium, GD 2011, Eindhoven, The Netherlands, September 21-23, 2011. Revised Selected Papers)
Graph Drawing
Graph Drawing (19th International Symposium, GD 2011, Eindhoven, The Netherlands, September 21-23, 2011. Revised Selected Papers), 445-446
STARTPAGE=445;ENDPAGE=446;TITLE=Graph Drawing (19th International Symposium, GD 2011, Eindhoven, The Netherlands, September 21-23, 2011. Revised Selected Papers)
A metro map, or subway map, is a schematic representation of a metro system of a city. The main goal of a metro map is to provide a traveler with information on which lines to take to get from station A to station B, and at which stations he needs to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3872656bdc68e2cb0a4bcfe35a782ded
https://doi.org/10.1007/978-3-642-25878-7_45
https://doi.org/10.1007/978-3-642-25878-7_45