DDevelopment & Design

TouK na WGK 2012TouK on WGK 2012

  • bymrk
  • September 6, 2012
  • 1 minute read

W tym roku wzięliśmy udział w konferencji Wytwarzania Gier Komputerowych. Konferencja odbyła się na Politechnice Gdańskiej w dniach od 31 sierpnia do 2 września. Wróciliśmy stamtąd z nagrodami.

Na konferencji Michał Trzaskowski wygłosił referat „Od (web)aplikacji biznesowych po (web)game dev. Testowanie i spełnianie oczekiwań”. W konkursie Developers Showcase II-gie miejsce zajęła gra Gizarma, autorski projekt Michała Rokickiego z TouK. Gizarma to MMORTS inspirowany głównie strategiami z lat 90, obecnie istnieje grywalna wersja alfa.This year TouK was taking part in the National Conference on Computer Games Development. The conference took place on Gdańsk University of Technology on 31 August – 2 September. We came back from there with prizes.

We have given a lecture titled „From business (web)applications to (web)game dev. Testing and meeting expectations”. In the Developers Showcase contest the Gizarma project won the second place. Gizarma is a MMORTS inspired mostly by the strategies from the ’90, currently there is a playable alfa version, the project is developed by Michał Rokicki.

— Previous article

Summer internship all new low ceremony code review application

Next article —

W najbliższy weekend TouK startuje w turnieju beach soccera w Jarosławcu!

You May Also Like
DDevelopment & Design

Distributed scans with HBase

HBase is by design a columnar store, that is optimized for random reads. You just ask for a row using rowId as an identifier and you get your data instantaneously. Performing a scan on part or whole table is a completely different thing. First of all, it is sequential. Meaning it is rather slow, because it doesn't use all the RegionServers at the same time. It is implemented that way to realize the contract of Scan command - which has to return results sorted by key. So, how to do this efficiently?HBase is by design a columnar store, that is optimized for random reads. You just ask for a row using rowId as an identifier and you get your data instantaneously. Performing a scan on part or whole table is a completely different thing. First of all, it is sequential. Meaning it is rather slow, because it doesn't use all the RegionServers at the same time. It is implemented that way to realize the contract of Scan command - which has to return results sorted by key. So, how to do this efficiently?
DDevelopment & Design

Visualizing GIS data in JavaFX 2.0 beta using GeoTools

Geographic data mostly comprises of polygon coordinates sets along with attributes, like country or city name, etc. This is quite easy to visualize in JavaFX, which supports rendering for SVG paths. In the article, I show how to read such GIS data from...Geographic data mostly comprises of polygon coordinates sets along with attributes, like country or city name, etc. This is quite easy to visualize in JavaFX, which supports rendering for SVG paths. In the article, I show how to read such GIS data from...