( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Computing a Segment Center for a Planar Point Set.

, , , и . J. Algorithms, 15 (2): 314-323 (1993)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Micha Brumlik

Micha Deja

Micha Hoffmann

Micha Mleczko

Micha Mleczko

 

Другие публикации лиц с тем же именем

Constructing Two-Dimensional Voronoi Diagrams via Divide-and-Conquer of Envelopes in Space., , и . Trans. Comput. Sci., (2010)The Upper Envelope of voronoi Surfaces and Its Applications., , и . Discret. Comput. Geom., (1993)Combinatorial Complexity Bounds for Arrangement of Curves and Spheres., , , , и . Discret. Comput. Geom., (1990)The Maximum Number of Ways To Stab n Convex Nonintersecting Sets in the Plane Is 2n-2., и . Discret. Comput. Geom., (1990)On the Union of Jordan Regions and Collision-Free Translational Motion Amidst Polygonal Obstacles., , , и . Discret. Comput. Geom., (1986)On Triple Intersections of Three Families of Unit Circles., , и . Discret. Comput. Geom., 54 (4): 930-953 (2015)On Levels in Arrangements of Lines, Segments, Planes, and Triangles%., , , и . Discret. Comput. Geom., 19 (3): 315-331 (1998)Applications of a New Space Partitioning Technique., и . WADS, том 519 из Lecture Notes in Computer Science, стр. 379-391. Springer, (1991)Ray Shooting in Polygons Using Geodesic Triangulations., , , , , , и . ICALP, том 510 из Lecture Notes in Computer Science, стр. 661-646. Springer, (1991)Time and space efficient collinearity indexing., , , и . Comput. Geom., (2023)