default search action
Elisha Sacks
- > Home > Persons > Elisha Sacks
Publications
- 2022
- [j43]Victor Milenkovic, Elisha Sacks:
Efficient Predicate Evaluation Using Randomized Degeneracy Detection. Int. J. Comput. Geom. Appl. 32(1&2): 39-54 (2022) - [c34]Victor Milenkovic, Elisha Sacks:
Efficient Predicate Evaluation using Statistical Degeneracy Detection. CCCG 2022: 235-242 - 2019
- [j42]Victor Milenkovic, Elisha Sacks:
Geometric rounding and feature separation in meshes. Comput. Aided Des. 108: 12-18 (2019) - [j41]Victor Milenkovic, Elisha Sacks, Nabeel Butt:
Fast Detection of Degenerate Predicates in Free Space Construction. Int. J. Comput. Geom. Appl. 29(3): 219-237 (2019) - 2018
- [c33]Joseph Masterjohn, Victor Milenkovic, Elisha Sacks:
Finding Intersections of Algebraic curves in a Convex Region using Encasement. CCCG 2018: 91-97 - [c32]Chloe Arluck, Victor Milenkovic, Elisha Sacks:
Approximate Free Space Construction and Maximum Clearance Path Planning for a Four Degree of Freedom Robot. CCCG 2018: 223-229 - [c31]Victor Milenkovic, Elisha Sacks, Nabeel Butt:
Table Based Detection of Degenerate Predicates in Free Space Construction. SoCG 2018: 61:1-61:14 - [i3]Victor Milenkovic, Elisha Sacks, Nabeel Butt:
Table Based Detection of Degenerate Predicates in Free Space Construction. CoRR abs/1803.06908 (2018) - [i2]Victor Milenkovic, Elisha Sacks:
Geometric Rounding and Feature Separation in Meshes. CoRR abs/1805.03252 (2018) - 2017
- [j40]Elisha Sacks, Nabeel Butt, Victor Milenkovic:
Robust free space construction for a polyhedron with planar motion. Comput. Aided Des. 90: 18-26 (2017) - 2015
- [j38]Min-Ho Kyung, Elisha Sacks, Victor Milenkovic:
Robust polyhedral Minkowski sums with GPU implementation. Comput. Aided Des. 67-68: 48-57 (2015) - 2014
- [j37]Elisha Sacks, Victor Milenkovic:
Robust cascading of operations on polyhedra. Comput. Aided Des. 46: 216-220 (2014) - 2013
- [j36]Victor Milenkovic, Elisha Sacks, Steven Trac:
Planar Shape Manipulation using Approximate Geometric Primitives. Int. J. Comput. Geom. Appl. 23(1): 1-28 (2013) - [j35]Victor Milenkovic, Elisha Sacks, Steven Trac:
Robust Free Space Computation for Curved Planar Bodies. IEEE Trans Autom. Sci. Eng. 10(4): 875-883 (2013) - 2012
- [c30]Victor Milenkovic, Elisha Sacks, Steven Trac:
Robust Complete Path Planning in the Plane. WAFR 2012: 37-52 - [i1]Victor Milenkovic, Elisha Sacks, Steven Trac:
Planar shape manipulation using approximate geometric primitives. CoRR abs/1210.0607 (2012) - 2011
- [j34]Elisha Sacks, Victor Milenkovic, Min-Ho Kyung:
Controlled linear perturbation. Comput. Aided Des. 43(10): 1250-1257 (2011) - [c29]Elisha Sacks, Victor Milenkovic, Yujun Wu:
Robust approximate assembly partitioning. CCCG 2011 - 2010
- [j33]Victor Milenkovic, Elisha Sacks:
Two Approximate Minkowski Sum Algorithms. Int. J. Comput. Geom. Appl. 20(4): 485-509 (2010) - [c28]Victor Milenkovic, Elisha Sacks, Min-Ho Kyung:
Robust Minkowski sums of polyhedra via controlled linear perturbation. Symposium on Solid and Physical Modeling 2010: 23-30 - 2007
- [j32]Victor Milenkovic, Elisha Sacks:
An Approximate Arrangement Algorithm for Semi-Algebraic Curves. Int. J. Comput. Geom. Appl. 17(2): 175-198 (2007) - [j31]Victor Milenkovic, Elisha Sacks:
A Monotonic Convolution for Minkowski Sums. Int. J. Comput. Geom. Appl. 17(4): 383-396 (2007) - 2006
- [c25]Victor Milenkovic, Elisha Sacks:
An approximate arrangement algorithm for semi-algebraic curves. SCG 2006: 237-246
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-07-20 21:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint