نتایج جستجو برای: drawing fixed shapes

تعداد نتایج: 292167  

1993
Roman E. Maeder

Uniform polyhedra consist of regular faces and congruent vertices. Allowing for nonconvex faces and vertex figures, there are 75 such polyhedra, as well as 2 infinite families of prisms and antiprisms. A recently discovered uniform way of computing their vertex coordinates is the basis for our program to display all of these solids, among which are many beautiful and stunning shapes. We will al...

Journal: :Bioinformatics 2005
Geert Trooskens David De Beule Frederik Decouttere Wim Van Criekinge

SUMMARY TreeIllustrator is a user-friendly application to visualize and customize phylogenetic trees. It has a broad range of functions and capabilities, such as dragging of nodes, different tree shapes, zooming and searching capabilities, and support for large trees. It acts as a solution that integrates the specificity of visualizing phylogenetic trees and the customization options of a drawi...

Journal: :Image Vision Comput. 2014
Antonio Monroy Peter Bell Björn Ommer

a r t i c l e i n f o This paper describes an approach for automatically analyzing the alterations of an original artwork during its reproduction. The overall deformation of the artwork is modelled by a piecewise linear model, where regions of the artwork that feature similar alterations are automatically inferred and assigned to the different model components. Model complexity, that is, the re...

2005
Zein Salah Dirk Bartz Wolfgang Straßer

Medical illustrations use simple drawing styles to demonstrate shapes and features of organs and organ systems, while omitting irrelevant details. In this contribution, we present a non-photorealistic rendering algorithm for illustrating anatomical data. Unlike other existing methods that rely on available triangulations of the organs to be rendered, our approach relies only on a subset of surf...

2007
Michael J. Pelsmajer Marcus Schaefer Daniel Stefankovic

The odd crossing number of G is the smallest number of pairs of edges that cross an odd number of times in any drawing of G. We show that there always is a drawing realizing the odd crossing number of G whose crossing number is at most 9, where k is the odd crossing number of G. As a consequence of this and a result of Grohe we can show that the odd crossing number is fixed-parameter tractable.

2005
John S Gero

Shapes play an important role in at least three domains. Drawn shapes are used to represent ideas, concepts, and possible physical worlds. Perceived shapes are the way we begin to understand the world our visual sense brings to us (Marr, 1982). Computer generated shapes play a critical role in computer-aided design systems and in many areas of artificial intelligence generally. Drawn shapes spe...

2013
STANISLAW ZABRAMSKI

Zabramski, S. 2014. Creating Digital Traces of Ideas. Evaluation of Computer Input Methods in Creative and Non-Creative Drawing. Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Social Sciences 94. 110 pp. Uppsala: Acta Universitatis Upsaliensis. ISBN 978-91-554-8911-3. Ideas are formed in a process of idea generation that includes creation, development, and communic...

Journal: :Journal of experimental psychology. Human perception and performance 2014
Etienne Thoret Mitsuko Aramaki Richard Kronland-Martinet Jean-Luc Velay Sølvi Ystad

This study investigates the human ability to perceive biological movements through friction sounds produced by drawings and, furthermore, the ability to recover drawn shapes from the friction sounds generated. In a first experiment, friction sounds, real-time synthesized and modulated by the velocity profile of the drawing gesture, revealed that subjects associated a biological movement to thos...

2017
Steven Chaplick Krzysztof Fleszar Fabian Lipp Alexander Ravsky Oleg Verbitsky Alexander Wolff

It is well known that any graph admits a crossing-free straight-line drawing in R3 and that any planar graph admits the same even in R2. For a graph G and d ∈ {2, 3}, let ρd(G) denote the minimum number of lines in Rd that together can cover all edges of a drawing of G. For d = 2, G must be planar. We investigate the complexity of computing these parameters and obtain the following hardness and...

2009
Nasir Rajpoot Muhammad Arif

The quotient space of all smooth and connected curves represented by a fixed number of boundary points is a finite-dimensional Riemannian manifold, also known as a shape manifold. This makes the preservation of locality a critically important issue when reducing the dimensionality of shapes on the manifold. We present a completely unsupervised clustering algorithm employing diffusion maps for l...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید