default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRon Wein
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
[b2]Efi Fogel, Dan Halperin, Ron Wein:
CGAL Arrangements and Their Applications - A Step-by-Step Guide. Geometry and Computing 7, Springer 2012, ISBN 978-3-642-17282-3, pp. I-XIX, 1-293- 2010
- [j8]Eric Berberich, Efi Fogel
, Dan Halperin, Kurt Mehlhorn, Ron Wein:
Arrangements on Parametric Surfaces I: General Framework and Infrastructure. Math. Comput. Sci. 4(1): 45-66 (2010)
2000 – 2009
- 2009
- [j7]Iddo Hanniel, Ron Wein:
An Exact, Complete and Efficient Computation of Arrangements of Bézier Curves. IEEE Trans Autom. Sci. Eng. 6(3): 399-408 (2009) - 2008
- [j6]Ron Wein, Jur P. van den Berg, Dan Halperin:
Planning High-quality Paths and Corridors Amidst Obstacles. Int. J. Robotics Res. 27(11-12): 1213-1231 (2008) - 2007
- [b1]Ron Wein:
The integration of exact arrangements with effective motion planning. Tel Aviv University, Israel, 2007 - [j5]Ron Wein:
Exact and approximate construction of offset polygons. Comput. Aided Des. 39(6): 518-527 (2007) - [j4]Ron Wein, Jur P. van den Berg, Dan Halperin:
The visibility-Voronoi complex and its applications. Comput. Geom. 36(1): 66-87 (2007) - [j3]Ron Wein, Efi Fogel, Baruch Zukerman, Dan Halperin:
Advanced programming techniques applied to Cgal's arrangement package. Comput. Geom. 38(1-2): 37-63 (2007) - [c8]Eric Berberich, Efi Fogel, Dan Halperin, Kurt Mehlhorn, Ron Wein:
Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step. ESA 2007: 645-656 - [c7]Iddo Hanniel, Ron Wein:
An exact, complete and efficient computation of arrangements of Bézier curves. Symposium on Solid and Physical Modeling 2007: 253-263 - 2006
- [c6]Ron Wein:
Exact and Efficient Construction of Planar Minkowski Sums Using the Convolution Method. ESA 2006: 829-840 - [c5]Ron Wein, Jur P. van den Berg, Dan Halperin:
Planning Near-Optimal Corridors Amidst Obstacles. WAFR 2006: 491-506 - 2005
- [j2]Oleg Ilushin, Gershon Elber, Dan Halperin, Ron Wein, Myung-Soo Kim:
Precise global collision detection in multi-axis NC-machining. Comput. Aided Des. 37(9): 909-920 (2005) - [j1]Ron Wein, Oleg Ilushin, Gershon Elber, Dan Halperin:
Continuous Path Verification in Multi-axis Nc-machining. Int. J. Comput. Geom. Appl. 15(4): 351-378 (2005) - [c4]Ron Wein, Jur P. van den Berg, Dan Halperin:
The Visibility-Voronoi Complex and Its Applications. SCG 2005: 63-72 - [i1]Ron Wein, Jur P. van den Berg, Dan Halperin:
The visibility-Voronoi complex and its applications. EuroCG 2005: 151-154 - 2004
- [c3]Ron Wein, Oleg Ilushin, Gershon Elber, Dan Halperin:
Continuous path verification in multi-axis NC-machining. SCG 2004: 86-95 - [c2]Efi Fogel, Ron Wein, Dan Halperin:
Code Flexibility and Program Efficiency by Genericity: Improving Cgal's Arrangements. ESA 2004: 664-676 - 2002
- [c1]Ron Wein:
High-Level Filtering for Arrangements of Conic Arcs. ESA 2002: 884-895
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 2025-01-09 12:52 CET 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:
