default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNicola Wolpert
Person information
- affiliation: Hochschule für Technik Stuttgart, Germany
- affiliation (former): Max Planck Institute for Informatics, Saarbrücken, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c25]Qendrim Bytyqi, Nicola Wolpert, Elmar Schömer, Ulrich Schwanecke:
Prototype Softmax Cross Entropy: A New Perspective on Softmax Cross Entropy. SCIA (2) 2023: 16-31- 2022
- [c24]Robert Hegewald, Nicola Wolpert, Elmar Schömer
:
Iterative Mesh Modification Planning: A new Method for Automatic Disassembly Planning of Complex Industrial Components. ICRA 2022: 336-342 - [c23]Michele Franco Adesso, Robert Hegewald, Nicola Wolpert, Elmar Schömer, Bianca Maier, Benjamin A. Epple:
Automatic Classification and Disassembly of Fasteners in Industrial 3D CAD-Scenarios. ICRA 2022: 9874-9880 - [c22]Sebastian Dorn, Nicola Wolpert, Elmar Schömer:
An Assembly Sequence Planning Framework for Complex Data using General Voronoi Diagram. ICRA 2022: 9896-9902 - [c21]Robert Hegewald, Nicola Wolpert, Elmar Schömer:
Simulation and Optimization of Industrial Disassembly Paths using Position Based Dynamics. MMAR 2022: 282-287 - 2021
- [c20]Michele Franco Adesso, Nicola Wolpert, Elmar Schömer:
ConfusionTree-Pattern: A Hierarchical Design for an Efficient and Performant Multi-Class Pattern. ICMLA 2021: 754-759 - [c19]Robert Hegewald, Nicola Wolpert, Elmar Schömer:
Saliency Features for 3D CAD-Data in the Context of Sampling-Based Motion Planning. ICRA 2021: 7858-7864 - [c18]Sebastian Dorn, Nicola Wolpert, Elmar Schömer:
Expansive Voronoi Tree: A Motion Planner for Assembly Sequence Planning. ICRA 2021: 7880-7886 - 2020
- [c17]Sebastian Dorn, Nicola Wolpert, Elmar Schömer:
Voxel-based General Voronoi Diagram for Complex Data with Application on Motion Planning. ICRA 2020: 137-143 - [i2]Qendrim Bytyqi, Nicola Wolpert, Elmar Schömer:
Local-Area-Learning Network: Meaningful Local Areas for Efficient Point Cloud Analysis. CoRR abs/2006.07226 (2020)
2010 – 2019
- 2017
- [c16]Daniel Schneider, Elmar Schömer, Nicola Wolpert:
Collision detection for 3D rigid body motion planning with narrow passages. ICRA 2017: 4365-4370 - 2015
- [j3]Stefan Funke, Theocharis Malamatos, Domagoj Matijevic, Nicola Wolpert:
Conic nearest neighbor queries and approximate Voronoi diagrams. Comput. Geom. 48(2): 76-86 (2015) - [c15]Daniel Schneider, Elmar Schömer, Nicola Wolpert:
Completely randomized RRT-connect: A case study on 3D rigid body motion planning. ICRA 2015: 2944-2950 - [c14]Daniel Schneider, Elmar Schömer, Nicola Wolpert:
A motion planning algorithm for the invalid initial state disassembly problem. MMAR 2015: 35-40 - 2012
- [c13]Rainer Erbes, Anja Mantel, Elmar Schömer, Nicola Wolpert:
Parallel Collision Queries on the GPU - A Comparative Study of Different CUDA Implementations. Facing the Multicore-Challenge 2012: 84-95 - 2010
- [c12]Oswin Aichholzer, Wolfgang Aigner, Thomas Hackl, Nicola Wolpert:
Exact Medial Axis Computation for Circular Arc Boundaries. Curves and Surfaces 2010: 28-42
2000 – 2009
- 2007
- [c11]Arno Eigenwillig, Lutz Kettner, Nicola Wolpert:
Snap rounding of Bézier curves. SCG 2007: 158-167 - [c10]Arno Eigenwillig, Michael Kerber, Nicola Wolpert:
Fast and exact geometric analysis of real algebraic plane curves. ISSAC 2007: 151-158 - 2006
- [j2]Elmar Schömer, Nicola Wolpert:
An exact and efficient approach for computing a cell in an arrangement of quadrics. Comput. Geom. 33(1-2): 65-97 (2006) - [j1]Arno Eigenwillig, Lutz Kettner, Elmar Schömer, Nicola Wolpert:
Exact, efficient, and complete arrangement computation for cubic curves. Comput. Geom. 35(1-2): 36-73 (2006) - [c9]Stefan Funke, Theocharis Malamatos, Domagoj Matijevic, Nicola Wolpert:
(Approximate) Conic Nearest Neighbors and the induced Voronoi Diagram. CCCG 2006 - [i1]Kurt Mehlhorn, Arno Eigenwillig, Lutz Kettner, Werner Krandick, Susanne Schmitt, Nicola Wolpert:
A Descartes Algorithms for Polynomials with Bit-Stream Coefficients. Reliable Implementation of Real Number Algorithms 2006 - 2005
- [c8]Arno Eigenwillig, Lutz Kettner, Werner Krandick, Kurt Mehlhorn, Susanne Schmitt, Nicola Wolpert:
A Descartes Algorithm for Polynomials with Bit-Stream Coefficients. CASC 2005: 138-149 - [c7]Eric Berberich, Michael Hemmer, Lutz Kettner, Elmar Schömer, Nicola Wolpert:
An exact, complete and efficient implementation for computing planar maps of quadric intersection curves. SCG 2005: 99-106 - [c6]Raimund Seidel, Nicola Wolpert:
On the exact computation of the topology of real algebraic curves. SCG 2005: 107-115 - [c5]Eric Berberich, Arno Eigenwillig, Michael Hemmer, Susan Hert, Lutz Kettner, Kurt Mehlhorn, Joachim Reichel, Susanne Schmitt, Elmar Schömer, Nicola Wolpert:
EXACUS: Efficient and Exact Algorithms for Curves and Surfaces. ESA 2005: 155-166 - 2004
- [b1]Nicola Wolpert:
An exact and efficient approach for computing a cell in an arrangement of quadrics. Saarland University, Saarbrücken, Germany, 2004, pp. 1-163 - [c4]Arno Eigenwillig, Lutz Kettner, Elmar Schömer, Nicola Wolpert:
Complete, exact, and efficient computations with cubic curves. SCG 2004: 409-418 - 2003
- [c3]Nicola Wolpert:
Jacobi Curves: Computing the Exact Topology of Arrangements of Non-singular Algebraic Curves. ESA 2003: 532-543 - 2001
- [c2]Nicola Geismann, Michael Hemmer, Elmar Schömer:
Computing a 3-dimensional cell in an arrangement of quadrics: exactly and actually! SCG 2001: 264-273 - [c1]Nicola Geismann, Michael Hemmer, Elmar Schömer:
The convex hull of ellipsoids. SCG 2001: 321-322
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-05-08 21:41 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:
