default search action
Alexandros I. Ginnis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j10]Panagiotis D. Kaklis, S. Stamatelopoulos, Alexandros I. Ginnis:
Shape-preserving interpolation on surfaces via variable-degree splines. Comput. Aided Geom. Des. 109: 102276 (2024)
2010 – 2019
- 2017
- [j9]Konstantinos V. Kostas
, Alexandros I. Ginnis, Constantinos G. Politis, Panagiotis D. Kaklis:
Shape-optimization of 2D hydrofoils using an Isogeometric BEM solver. Comput. Aided Des. 82: 79-87 (2017) - [j8]Alexandros I. Ginnis, Konstantinos V. Kostas
Construction of smooth branching surfaces using T-splines. Comput. Aided Des. 92: 22-32 (2017) - 2013
- [c5]Alexandros I. Ginnis, Konstantinos V. Kostas
VELOS - A VR Environment for Ship Applications: Current Status and Planned Extensions. Virtual Realities 2013: 33-55 - 2010
- [j7]Alexandros I. Ginnis, Konstantinos V. Kostas
VELOS: A VR platform for ship-evacuation analysis. Comput. Aided Des. 42(11): 1045-1058 (2010)
2000 – 2009
- 2009
- [j6]E. I. Karousos, Alexandros I. Ginnis, Panagiotis D. Kaklis:
Controlling torsion sign. Comput. Aided Geom. Des. 26(4): 396-411 (2009) - [j5]Alexandros I. Ginnis, E. I. Karousos, Panagiotis D. Kaklis:
A discrete methodology for controlling the sign of curvature and torsion for NURBS. Computing 86(2-3): 117-129 (2009) - [c4]Costas Politis, Alexandros I. Ginnis, Panagiotis D. Kaklis, Kostas Belibassakis
An isogeometric BEM for exterior potential-flow problems in the plane. Symposium on Solid and Physical Modeling 2009: 349-354 - 2008
- [c3]E. I. Karousos, Alexandros I. Ginnis, Panagiotis D. Kaklis:
Controlling Torsion Sign. GMP 2008: 92-106 - 2007
- [j4]Nikolaos C. Gabrielides
G1-smooth branching surface construction from cross sections. Comput. Aided Des. 39(8): 639-651 (2007) - [j3]E. I. Karousos, Alexandros I. Ginnis, Panagiotis D. Kaklis:
Quantifying the effect of a control point on the sign of curvature. Computing 79(2-4): 249-259 (2007) - 2006
- [c2]Nikolaos C. Gabrielides
Constructing smooth branching surfaces from cross sections. Symposium on Solid and Physical Modeling 2006: 161-170 - 2004
- [c1]Konstantinos V. Kostas
A Scan-Line Algorithm for Clustering Line Segments. SMI 2004: 379-382 - 2002
- [j2]Panagiotis D. Kaklis, Alexandros I. Ginnis:
Planar C2 cubic spline interpolation under geometric boundary conditions. Comput. Aided Geom. Des. 19(5): 345-363 (2002)
1990 – 1999
- 1996
- [j1]Panagiotis D. Kaklis, Alexandros I. Ginnis:
Sectional-curvature preserving skinning surfaces. Comput. Aided Geom. Des. 13(7): 601-619 (1996) - 1994
- [p1]Alexandros I. Ginnis, Panagiotis D. Kaklis, Nickolas S. Sapidis:
10. Polynomial Splines of Nonuniform Degree: Controlling Convexity and Fairness. Designing Fair Curves and Surfaces 1994: 253-274
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-06-10 21:20 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: