Nicola Wolpert

Affiliations:
  • Hochschule für Technik Stuttgart, Germany
  • Max Planck Institute for Informatics, Saarbrücken, Germany (former)


According to our database1, Nicola Wolpert authored at least 31 papers between 2001 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Prototype Softmax Cross Entropy: A New Perspective on Softmax Cross Entropy.
Proceedings of the Image Analysis - 22nd Scandinavian Conference, 2023

2022
Simulation and Optimization of Industrial Disassembly Paths using Position Based Dynamics.
Proceedings of the 26th International Conference on Methods and Models in Automation and Robotics, 2022

Iterative Mesh Modification Planning: A new Method for Automatic Disassembly Planning of Complex Industrial Components.
Proceedings of the 2022 International Conference on Robotics and Automation, 2022

An Assembly Sequence Planning Framework for Complex Data using General Voronoi Diagram.
Proceedings of the 2022 International Conference on Robotics and Automation, 2022

Automatic Classification and Disassembly of Fasteners in Industrial 3D CAD-Scenarios.
Proceedings of the 2022 International Conference on Robotics and Automation, 2022

2021
Saliency Features for 3D CAD-Data in the Context of Sampling-Based Motion Planning.
Proceedings of the IEEE International Conference on Robotics and Automation, 2021

Expansive Voronoi Tree: A Motion Planner for Assembly Sequence Planning.
Proceedings of the IEEE International Conference on Robotics and Automation, 2021

ConfusionTree-Pattern: A Hierarchical Design for an Efficient and Performant Multi-Class Pattern.
Proceedings of the 20th IEEE International Conference on Machine Learning and Applications, 2021

2020
Local-Area-Learning Network: Meaningful Local Areas for Efficient Point Cloud Analysis.
CoRR, 2020

Voxel-based General Voronoi Diagram for Complex Data with Application on Motion Planning.
Proceedings of the 2020 IEEE International Conference on Robotics and Automation, 2020

2017
Collision detection for 3D rigid body motion planning with narrow passages.
Proceedings of the 2017 IEEE International Conference on Robotics and Automation, 2017

2015
Conic nearest neighbor queries and approximate Voronoi diagrams.
Comput. Geom., 2015

A motion planning algorithm for the invalid initial state disassembly problem.
Proceedings of the 20th International Conference on Methods and Models in Automation and Robotics, 2015

Completely randomized RRT-connect: A case study on 3D rigid body motion planning.
Proceedings of the IEEE International Conference on Robotics and Automation, 2015

2012
Parallel Collision Queries on the GPU - A Comparative Study of Different CUDA Implementations.
Proceedings of the Facing the Multicore-Challenge, 2012

2010
Exact Medial Axis Computation for Circular Arc Boundaries.
Proceedings of the Curves and Surfaces, 2010

2007
Fast and exact geometric analysis of real algebraic plane curves.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2007

Snap rounding of Bézier curves.
Proceedings of the 23rd ACM Symposium on Computational Geometry, 2007

2006
An exact and efficient approach for computing a cell in an arrangement of quadrics.
Comput. Geom., 2006

Exact, efficient, and complete arrangement computation for cubic curves.
Comput. Geom., 2006

A Descartes Algorithms for Polynomials with Bit-Stream Coefficients.
Proceedings of the Reliable Implementation of Real Number Algorithms: Theory and Practice, 08.01., 2006

(Approximate) Conic Nearest Neighbors and the induced Voronoi Diagram.
Proceedings of the 18th Annual Canadian Conference on Computational Geometry, 2006

2005
EXACUS: Efficient and Exact Algorithms for Curves and Surfaces.
Proceedings of the Algorithms, 2005

On the exact computation of the topology of real algebraic curves.
Proceedings of the 21st ACM Symposium on Computational Geometry, 2005

An exact, complete and efficient implementation for computing planar maps of quadric intersection curves.
Proceedings of the 21st ACM Symposium on Computational Geometry, 2005

A Descartes Algorithm for Polynomials with Bit-Stream Coefficients.
Proceedings of the Computer Algebra in Scientific Computing, 8th International Workshop, 2005

2004
An exact and efficient approach for computing a cell in an arrangement of quadrics.
PhD thesis, 2004

Complete, exact, and efficient computations with cubic curves.
Proceedings of the 20th ACM Symposium on Computational Geometry, 2004

2003
Jacobi Curves: Computing the Exact Topology of Arrangements of Non-singular Algebraic Curves.
Proceedings of the Algorithms, 2003

2001
The convex hull of ellipsoids.
Proceedings of the Seventeenth Annual Symposium on Computational Geometry, 2001

Computing a 3-dimensional cell in an arrangement of quadrics: exactly and actually!
Proceedings of the Seventeenth Annual Symposium on Computational Geometry, 2001


  Loading...