default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlfred Schmitt
Person information
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2006
[c9]Dieter Finkenzeller, Alfred Schmitt:
Rapid Modeling of Complex Building Façades. Eurographics (Short Presentations) 2006: 95-98- 2005
- [j6]Sven Thüring, Jörn Herwig, Alfred Schmitt:
Silhouette-based motion capture for interactive VR-systems including a rear projection screen. Comput. Animat. Virtual Worlds 16(3-4): 245-257 (2005) - 2004
- [c8]Sven Forstmann, Yutaka Kanou, Jun Ohya, Sven Thüring, Alfred Schmitt:
Real-Time Stereo by using Dynamic Programming. CVPR Workshops 2004: 29
1990 – 1999
- 1999
- [c7]Alfred Schmitt, Peter Oel:
Calculation of Totally Optimized Button Configurations Using Fitts' Law. HCI (1) 1999: 392-396 - 1991
- [c6]Alfred Schmitt, Achim Stößer:
Some Annotations on X-ray Tracing. Focus on Scientific Visualization 1991: 325-335 - 1990
- [c5]Alfred Schmitt, Wolfgang Leister
:
Simulation dynamischer Massenpunktsysteme und ihre Anwendung in der Computeranimation. GI Jahrestagung (2) 1990: 559-568
1980 – 1989
- 1988
- [c4]Achim Stößer, Alfred Schmitt, Burkhard Neidecker, Heinrich Müller, Thomas Maus, Wolfgang Leister:
Tools for Efficient Photo-Realistic Computer Animation. Eurographics 1988 - 1985
- [j5]Heinrich Müller, Alfred Schmitt, Stephan Abramowski:
Visible surface calculation for complex unstructured polygonal scences. Computing 35(3-4): 231-246 (1985) - 1983
- [j4]Alfred Schmitt:
On the Number of Relational Operators Necessary to Compute Certain Functions of Real Variables. Acta Informatica 19: 297-304 (1983) - 1982
- [j3]Alfred Schmitt:
On the Computational Power of the Floor Function. Inf. Process. Lett. 14(1): 1-3 (1982) - [c3]Alfred Schmitt:
Reporting Intersections of Line Segments: An Improvement of the Ottmann-Bentley Algorithm. WG 1982: 257-266 - 1981
- [c2]Alfred Schmitt:
Time and Space Bounds for Hidden Line and Hidden Surface Algorithms. Eurographics 1981 - [c1]Alfred Schmitt:
Reporting Geometric Inclusions with an Application to the Hidden Line Problem. WG 1981: 135-144
1960 – 1969
- 1969
- [j2]Alfred Schmitt:
Über Teilnehmer-Rechensysteme für programmierten Unterricht. Elektron. Rechenanlagen 11(3): 143-150 (1969) - 1968
- [j1]Alfred Schmitt:
Über die Berechnung minimaler Turingmaschinen und anderer minimaler Systeme. J. Inf. Process. Cybern. 4(5): 313-326 (1968)
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-04-24 22:50 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:
