Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputational Geometry, Volume 39
Volume 39, Number 1, January 2008
- Prosenjit Bose
, Thomas Fevens:
Editorial. 1 - Harish Gopala, Pat Morin:
Algorithms for bivariate zonoid depth. 2-13 - Ferran Hurtado, Mikio Kano, David Rappaport, Csaba D. Tóth:
Encompassing colored planar straight line graphs. 14-23 - Bernard Chazelle, Ding Liu, Avner Magen:
Approximate range searching in higher dimension. 24-29 - Greg Aloupis, Erik D. Demaine, Stefan Langerman, Pat Morin, Joseph O'Rourke, Ileana Streinu, Godfried T. Toussaint:
Edge-unfolding nested polyhedral bands. 30-42 - Mirela Damian, Joseph O'Rourke:
On corners of objects built from parallelepiped bricks. 43-54 - Jean Cardinal, Sébastien Collette, Stefan Langerman:
Local properties of geometric graphs. 55-64
Volume 39, Number 2, February 2008
- Manuel Abellanas, Prosenjit Bose, Alfredo García Olaverri, Ferran Hurtado, Pedro Ramos, Eduardo Rivera-Campo, Javier Tejel:
On local transformations in plane geometric graphs embedded on small grids. 65-77 - Alireza Zarei, Mohammad Ghodsi:
Query point visibility computation in polygons with holes. 78-90 - Theocharis Malamatos:
Lower bounds for expected-case planar point location. 91-103 - Ho-Lun Cheng, Tony Tan:
Approximating polyhedral objects with deformable smooth surfaces. 104-117 - Sergio Cabello, Panos Giannopoulos, Christian Knauer, Günter Rote:
Matching point sets with respect to the Earth Mover's Distance. 118-133 - Oswin Aichholzer, Franz Aurenhammer, Paola Gonzalez-Nava, Thomas Hackl, Clemens Huemer, Ferran Hurtado, Hannes Krasser, Saurabh Ray, Birgit Vogtenhuber:
Matching edges and faces in polygonal partitions. 134-141
Volume 39, Number 3, April 2008
- Gill Barequet, Matthew T. Dickerson, Yuval Scharf:
Covering points with a polygon. 143-162 - Esther Moet, Christian Knauer, Marc J. van Kreveld:
Visibility maps of segments and triangles in 3D. 163-177 - Joachim Giesen, Matthias John:
The flow complex: A data structure for geometric modeling. 178-190 - John Hershberger, Subhash Suri:
Adaptive sampling for geometric problems over data streams. 191-208 - Paz Carmi, Matthew J. Katz, Nissan Lev-Tov:
Polynomial-time approximation schemes for piercing and covering with applications in wireless networks. 209-218 - Matthew J. Katz, Gabriel S. Roisman:
On guarding the vertices of rectilinear domains. 219-228 - Pat Morin:
An optimal randomized algorithm for d-variate zonoid depth. 229-235
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-05-02 21:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
