Facet browsing currently unavailable
Page 4 of 1731 results
Sort by: relevance publication year
Acknowledgement of priority — A fractional Helly theorem for boxes JOURNAL ARTICLE published January 2018 in Computational Geometry |
Natural neighbor coordinates of points on a surface JOURNAL ARTICLE published July 2001 in Computational Geometry |
Overlap of convex polytopes under rigid motion JOURNAL ARTICLE published January 2014 in Computational Geometry |
On the approximation of shortest escape paths JOURNAL ARTICLE published February 2021 in Computational Geometry |
Guaranteed quality tetrahedral Delaunay meshing for medical images JOURNAL ARTICLE published May 2014 in Computational Geometry Research funded by NSF (CCF-1139864,CCF-1136538,CSI-1136536) |
Faster core-set constructions and data-stream algorithms in fixed dimensions JOURNAL ARTICLE published August 2006 in Computational Geometry |
Witness (Delaunay) graphs JOURNAL ARTICLE published August 2011 in Computational Geometry |
Nearly equal distances and Szemerédi's regularity lemma JOURNAL ARTICLE published April 2006 in Computational Geometry |
Covering a bichromatic point set with two disjoint monochromatic disks JOURNAL ARTICLE published April 2013 in Computational Geometry |
Index JOURNAL ARTICLE published October 1999 in Computational Geometry |
Guest Editor's foreword JOURNAL ARTICLE published September 2015 in Computational Geometry |
Extreme point and halving edge search in abstract order types JOURNAL ARTICLE published October 2013 in Computational Geometry |
Combinatorial curve reconstruction in Hilbert spaces: A new sampling theory and an old result revisited JOURNAL ARTICLE published September 2002 in Computational Geometry |
A unified and efficient solution to the room search problem JOURNAL ARTICLE published May 2008 in Computational Geometry |
Interactive texture mapping for polygonal models JOURNAL ARTICLE published February 2000 in Computational Geometry |
Editorial Board JOURNAL ARTICLE published April 1996 in Computational Geometry |
Finding a shortest diagonal of a simple polygon in linear time JOURNAL ARTICLE published February 1997 in Computational Geometry |
Guest Editors' foreword JOURNAL ARTICLE published October 2010 in Computational Geometry |
Computing the visibility map of fat objects JOURNAL ARTICLE published May 2010 in Computational Geometry |
Constructing convex 3-polytopes from two triangulations of a polygon JOURNAL ARTICLE published May 2004 in Computational Geometry |