( en | de | ru )

 

Disambiguation of "Katz, Matthew J."

Author of the publication

copydeleteadd this publication to your clipboard
Approximating the Visible Region of a Point on a Terrain.

, , and . ALENEX/ANALC, page 120-128. SIAM, (2004)

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. You can also use the button next to the name to display some publications already assigned to the person.

Matthew Mellon

Matthew David

Olumuyiwa Matthew

Peter Matthew

Matthew Grum

 

Other publications of authors with the same name

Batched Point Location in SINR Diagrams via Algebraic Tools., and . CoRR, (2014)Realistic Input Models for Geometric Algorithms., , , and . Algorithmica, 34 (1): 81-97 (2002)Minimizing Total Interference in Asymmetric Sensor Networks., , and . ALGOSENSORS, volume 12503 of Lecture Notes in Computer Science, page 1-16. Springer, (2020)Computing Euclidean bottleneck matchings in higher dimensions., and . Inf. Process. Lett., 75 (4): 169-174 (2000)Computing Depth Orders for Fat Objects and Related Problems., , and . Comput. Geom., (1995)Bottleneck Steiner Tree with Bounded Number of Steiner Vertices., , and . CCCG, (2011)Resolving SINR Queries in a Dynamic Setting., , and . ICALP, volume 107 of LIPIcs, page 145:1-145:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Minimum-Link C-Oriented Paths Visiting a Sequence of Regions in the Plane., , , and . CIAC, volume 13898 of Lecture Notes in Computer Science, page 247-262. Springer, (2023)Conflict-Free Coloring of Points on a Line with respect to a Set of Intervals., , and . CCCG, page 93-96. Carleton University, Ottawa, Canada, (2007)Minimum-Cost Load-Balancing Partitions., and . CCCG, page 65-67. (2005)