![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Computer Aided Geometric Design, Volume 94
Volume 94, March 2022
- Q. Youn Hong
, Gershon Elber:
Detection and computation of conservative kernels of models consisting of freeform curves and surfaces, using inequality constraints. 102075 - Guangshun Wei
, Zhiming Cui, Jie Zhu, Lei Yang, Yuanfeng Zhou, Pradeep Singh, Min Gu, Wenping Wang:
Dense representative tooth landmark/axis detection network on 3D model. 102077 - Manish Mandad, Ruizhi Chen, David Bommes
, Marcel Campen:
Intrinsic mixed-integer polycubes for hexahedral meshing. 102078 - Manoj Kumar Mukundan, Ramanathan Muthuganapathy:
A parallel algorithm for computing Voronoi diagram of a set of circles using touching disc and topology matching. 102079 - Ye Ji
, Meng-Yun Wang, Maodong Pan, Yi Zhang, Chun-Gang Zhu
:
Penalty function-based volumetric parameterization method for isogeometric analysis. 102081 - Kanika Rajain, Oleksii Sliusarenko, Michal Bizzarri, Michael Barton:
Curve-guided 5-axis CNC flank milling of free-form surfaces using custom-shaped tools. 102082 - Nira Dyn, Kai Hormann
, Claudio Mancinelli
:
Non-uniform interpolatory subdivision schemes with improved smoothness. 102083
- Elena Campo-Montalvo
, Marian Fernández de Sevilla, Sonia Pérez-Díaz
:
A simple formula for the computation of branches and asymptotes of curves and some applications. 102084
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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.