default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGokul Varadhan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2007
[j6]Liangjun Zhang, Young J. Kim
, Gokul Varadhan, Dinesh Manocha:
Generalized penetration depth computation. Comput. Aided Des. 39(8): 625-638 (2007)- 2006
- [j5]Gokul Varadhan, Dinesh Manocha:
Accurate Minkowski sum approximation of polyhedral models. Graph. Model. 68(4): 343-355 (2006) - [j4]Nabil H. Mustafa, Shankar Krishnan, Gokul Varadhan, Suresh Venkatasubramanian:
Dynamic simplification and visualization of large maps. Int. J. Geogr. Inf. Sci. 20(3): 273-302 (2006) - [j3]Gokul Varadhan, Shankar Krishnan, T. V. N. Sriram, Dinesh Manocha:
A Simple Algorithm for Complete Motion Planning of Translating Polyhedral Robots. Int. J. Robotics Res. 25(11): 1049-1070 (2006) - [c13]Liangjun Zhang, Young J. Kim, Gokul Varadhan, Dinesh Manocha:
Fast C-obstacle Query Computation for Motion Planning. ICRA 2006: 3035-3040 - [c12]Gokul Varadhan, Young J. Kim, Shankar Krishnan, Dinesh Manocha:
Topology Preserving Approximation of Free Configuration Space. ICRA 2006: 3041-3048 - [c11]Gokul Varadhan, Shankar Krishnan, Liangjun Zhang, Dinesh Manocha:
Reliable implicit surface polygonization using visibility mapping. Symposium on Geometry Processing 2006: 211-221 - [c10]Liangjun Zhang, Young J. Kim, Gokul Varadhan, Dinesh Manocha:
Generalized penetration depth computation. Symposium on Solid and Physical Modeling 2006: 173-184 - 2005
- [j2]Gokul Varadhan, Shankar Krishnan, T. V. N. Sriram, Dinesh Manocha:
A Simple Algorithm for Complete Motion Planning of Translating Polyhedral Robots. Int. J. Robotics Res. 24(11): 983-995 (2005) - [c9]Gokul Varadhan, Dinesh Manocha:
Star-shaped Roadmaps - A Deterministic Sampling Approach for Complete Motion Planning. Robotics: Science and Systems 2005: 25-32 - 2004
- [j1]Young J. Kim, Gokul Varadhan, Ming C. Lin, Dinesh Manocha:
Fast swept volume approximation of complex polyhedral models. Comput. Aided Des. 36(11): 1013-1027 (2004) - [c8]Gokul Varadhan, Dinesh Manocha:
Accurate Minkowski Sum Approximation of Polyhedral Models. PG 2004: 392-401 - [c7]Gokul Varadhan, Shankar Krishnan, T. V. N. Sriram, Dinesh Manocha:
Topology Preserving Surface Extraction Using Adaptive Subdivision. Symposium on Geometry Processing 2004: 235-244 - [c6]Gokul Varadhan, Shankar Krishnan, T. V. N. Sriram, Dinesh Manocha:
A Simple Algorithm for Complete Motion Planning of Translating Polyhedral Robots. WAFR 2004: 441-456 - 2003
- [c5]Gokul Varadhan, Shankar Krishnan, Young J. Kim, Dinesh Manocha, Suhas N. Diggavi:
Efficient Max-Norm Distance Computation for Reliable Voxelization. Symposium on Geometry Processing 2003: 116-126 - [c4]Young J. Kim, Gokul Varadhan, Ming C. Lin, Dinesh Manocha:
Fast swept volume approximation of complex polyhedral models. Symposium on Solid Modeling and Applications 2003: 11-22 - [c3]Gokul Varadhan, Shankar Krishnan, Young J. Kim, Dinesh Manocha:
Feature-Sensitive Subdivision and Isosurface Reconstruction. IEEE Visualization 2003: 99-106 - 2002
- [c2]Gokul Varadhan, Warren Robinett, Dorothy Erie, Russell M. Taylor II:
Fast simulation of atomic-force-microscope imaging of atomic and polygonal surfaces using graphics hardware. Visualization and Data Analysis 2002: 116-124 - [c1]Gokul Varadhan, Dinesh Manocha:
Out-of-Core Rendering of Massive Geometric Datasets. IEEE Visualization 2002: 69-76
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:08 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:
