On the complexity of umbra and penumbra

Autor: Demouth, J., Devillers, O., Everett, H., Glisse, M., Lazard, S., Seidel, R.

Publikováno v: In Computational Geometry: Theory and Applications 2009 42(8):758-771

Succinct representations of planar maps

Autor: Castelli Aleardi, L., Devillers, O., Schaeffer, G.

Publikováno v: In Theoretical Computer Science 2008 408(2):174-187

The Historian John Zonaras: some observations on his sources and methods

Autor: Mallan, CT, Devillers, O, Sebastiani, B

Publikováno v: Les historiens grecs et romains: entre sources et modèles.

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=od______1064::1d258c9f66e8ec5428ad038ce8d273e4
http://ora.ox.ac.uk/objects/uuid:

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Vertex Deletion for 3D Delaunay Triangulations

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)

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