Projects tagged ‘c’ and ‘vector’

An Integrated Development Environment for producing presentation and simulation based eLearning (as Flash), similar to Macromedia Captivate. Licensed under the LGPLv3.

Simple editor for openstreetmap.org map data. OSM2Go is particularly suited for small-screen portable systems such as subnotebooks, handheld devices and netbooks which do not have a network connection ... [More] at all times. OpenStreetMap is the free, editable map of the world: the Wikipedia of maps. [Less]

Xarino is primarily a vector graphics (drawing and illustration) program but is one of the new generation of cross-over products that handles photos and drawings with equal ease. See xaralx.org for ... [More] details. Xarino is currently incomplete as it is an ongoing port to Linux of the finished product Xara Xtreme (see www.xara.com/xtreme). For the last 2 years or so it has been somewhat dead (the previous project was called XaraLX) so I am now in the process of resurrecting it :-) [Less]

C-vec is a compact library to handle dynamic abstract data types in C. It is now part of the c-libutl project --- DISCLAIMER: this is a working in progress. The code in the SVN repository is the ... [More] working copy and is updated constantly. I would gladly hear any suggestion or comments you may have. Remo.D [Less]

We are a group of skilled Java, C#, C++, PHP, and Html coders. Vector developments is here to continue, and or start new sources.

The generic data structure library is a bunch of data structures that are designed and created in as generic a fashion as possible. Each data structure will contain its own basic memory management, be ... [More] able to handle any object type, and hopefully constraint to strict algorithmic constraints. When the library hits version 1.0, it will contain the following data structures:       * Doubly Linked List - Done     * List-based Queue - Done     * List-based Deque - Done     * List-based Stack - Done     * Vector - Done     * Vector-based Queue - Done     * Vector-based Deque - Done     * Vector-based Stack -Done     * Binary Tree - Done     * Hash Table - Done     * Priority Queue - Done     * Heap - Done     * Memory Manager     * Object Cache w/ Garbage Collection     * AB Tree     * Split Lists     * RB Tree     * AVL Tree [Less]

GRAVITONYou are Captain Escavel, intrepid explorer (or at least, that's what you fancy yourself... your comrades prefer the word, well... "foolish"). You have a certain knack for getting yourself ... [More] stuck in the gravity well of black holes. Whether investigating on a science mission or using blackholes as gravity slingshot, you never quite manage to escape properly. Unfortunately, every black hole you've been drawn towards these days happens to have a large amount of debris floating towards it... said debris adds mass to the hole, and you know what that means. It gets bigger and can eventually swallow you! Alas, your thrusters are too weak to escape. Conveniently, you have a matter/energy transducer on board. You can collect radioactive asteroid cores and convert them into energy. Your goal is to strafe around the edge of the gravity well trying to hit and deflect as much of the flying debris as possible, while collecting enough cores to fully power your thrusters... before the void devours you. THRUSTERS: POWERUP! [Less]

Collection of C++ arrays for various purposes. Static arrays are allocated on the stack. Dynamic arrays are allocated on the heap. Resizable arrays are dynamic arrays with changeable size. Ptr arrays ... [More] are just pointers to somewhere. All arrays controls buffer overflows. Algorithms can be written in general manner without knowing specific type of arrays manipulated. [Less]

A set of C/C++ functions and methods meant to provide an optimized version of standard mathematical functions for armv6 processors implementing a vfp.

IntroductionV4P - Vectors For Pocket - is a minimalistic layered polygons scan-conversion engine. See http://en.wikipedia.org/wiki/Scanline_rendering if you don't understand what it deals with. V4P ... [More] consists in a ridiculously short piece of C code. V4P main engine weights ~1000 instructions. V4P targets very light platforms without advanced graphic processing hardware resources. V4P may be easily embedded in any GUI or Game development library or application. V4P has no dependencies with any other library. V4P even brings its own integer only maths routines. V4P only asks you to provide an horizontal line drawing function (a memset()-like function should work well in most cases). Beside rendering vectors scene, V4P will help you find collides. Design IntroductionThe underlying algorithm of V4P can be named: "Bresenham-like iterative scan-line and active edge cross-over computation based polygon scan conversion algorithm". Additionally, most V4P computed lists are smartly quick-sorted, while bit-based computation helps V4P to find collides and pixel highest owner. V4P design spares memory a lot. It doesn't deal with Z-buffer, not even "S-buffer" (as depicted here: http://www.gamedev.net/reference/articles/article668.asp). V4P has been developed and tested on a very old Sony Clie PDA with Palm OS 4 gcc based SDK. V4P should be able to be adapted with few tweakings on any embedded Linux devices and other geeky gadgets. Further experiments / What to do next?Actually, V4P is not a drawing engine. No span drawing function are provided. Except from the PDA experiment I've done. So... writing more span drawing functions# writing a Linux frame buffer port # write a SDL port # write a DirectFB port # write a DS Linux port Keep in mind the Color type is a pointer which may actually lead to a structure giving much more information about the way to fill up a polygon, eg. a pixmap. # simple anti-aliasing solution through rescaling trick writing other libraries on top of V4P# use V4P to design a Flash-like technology # use V4P as a basis for a full animated GUI stack adding featurestransparent polygonsthis feature needs a change in the pixel parent election code so to call the span drawing routine from the highest opaque polygon to the highest translucent polygon up there. adding other edge shapesI miss circular curves a lot. But I didn't find a way to draw them in a single pass algorithm. A simple Bezier discretisation algorithm may help. But has it to be in the core library? increasing z depth rangeonly 16 layers for now. Using a balanced binary tree of span parents could make z infinitively more precise. Use more accurate cos/sin/atan/dist routinesavoid refreshing the static parts of the scenean integrated solution need an in-depth rewrite an other solution may be to call the V4P engine repeatedly on "dirty rectangles". A top library could do that. [Less]