default search action
Search dblp for Publications
export results for "toc:db/journals/cagd/cagd59.bht:"
@article{DBLP:journals/cagd/AlcazarDM18, author = {Juan Gerardo Alc{\'{a}}zar and Heidi E. I. Dahl and Georg Muntingh}, title = {Symmetries of canal surfaces and Dupin cyclides}, journal = {Comput. Aided Geom. Des.}, volume = {59}, pages = {68--85}, year = {2018}, url = {https://doi.org/10.1016/j.cagd.2017.10.001}, doi = {10.1016/J.CAGD.2017.10.001}, timestamp = {Sat, 22 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cagd/AlcazarDM18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cagd/BirkM18, author = {Lothar Birk and T. Luke McCulloch}, title = {Robust generation of constrained B-spline curves based on automatic differentiation and fairness optimization}, journal = {Comput. Aided Geom. Des.}, volume = {59}, pages = {49--67}, year = {2018}, url = {https://doi.org/10.1016/j.cagd.2017.11.005}, doi = {10.1016/J.CAGD.2017.11.005}, timestamp = {Sat, 22 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cagd/BirkM18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cagd/BrummerMS18, author = {Stephan Brummer and Georg Maier and Tomas Sauer}, title = {Numerically robust computation of circular visibility}, journal = {Comput. Aided Geom. Des.}, volume = {59}, pages = {17--31}, year = {2018}, url = {https://doi.org/10.1016/j.cagd.2017.11.003}, doi = {10.1016/J.CAGD.2017.11.003}, timestamp = {Sat, 22 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cagd/BrummerMS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cagd/PaganiS18, author = {Luca Pagani and Paul J. Scott}, title = {Curvature based sampling of curves and surfaces}, journal = {Comput. Aided Geom. Des.}, volume = {59}, pages = {32--48}, year = {2018}, url = {https://doi.org/10.1016/j.cagd.2017.11.004}, doi = {10.1016/J.CAGD.2017.11.004}, timestamp = {Sat, 22 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cagd/PaganiS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cagd/WangG18, author = {Haohao Wang and Ron Goldman}, title = {Implicitizing ruled translational surfaces}, journal = {Comput. Aided Geom. Des.}, volume = {59}, pages = {98--106}, year = {2018}, url = {https://doi.org/10.1016/j.cagd.2017.11.001}, doi = {10.1016/J.CAGD.2017.11.001}, timestamp = {Sat, 22 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cagd/WangG18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cagd/WangHGZQH18, author = {Xiaochao Wang and Jianping Hu and Lixin Guo and Dongbo Zhang and Hong Qin and Aimin Hao}, title = {Feature-preserving, mesh-free empirical mode decomposition for point clouds and its applications}, journal = {Comput. Aided Geom. Des.}, volume = {59}, pages = {1--16}, year = {2018}, url = {https://doi.org/10.1016/j.cagd.2017.11.002}, doi = {10.1016/J.CAGD.2017.11.002}, timestamp = {Sun, 06 Oct 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cagd/WangHGZQH18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cagd/ZhaoKM18, author = {Yan Zhao and Yoshihiro Kanamori and Jun Mitani}, title = {Design and motion analysis of axisymmetric 3D origami with generic six-crease bases}, journal = {Comput. Aided Geom. Des.}, volume = {59}, pages = {86--97}, year = {2018}, url = {https://doi.org/10.1016/j.cagd.2017.10.002}, doi = {10.1016/J.CAGD.2017.10.002}, timestamp = {Sat, 22 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cagd/ZhaoKM18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.