• Announcements

    • khawk

      Download the Game Design and Indie Game Marketing Freebook   07/19/17

      GameDev.net and CRC Press have teamed up to bring a free ebook of content curated from top titles published by CRC Press. The freebook, Practices of Game Design & Indie Game Marketing, includes chapters from The Art of Game Design: A Book of Lenses, A Practical Guide to Indie Game Marketing, and An Architectural Approach to Level Design. The GameDev.net FreeBook is relevant to game designers, developers, and those interested in learning more about the challenges in game development. We know game development can be a tough discipline and business, so we picked several chapters from CRC Press titles that we thought would be of interest to you, the GameDev.net audience, in your journey to design, develop, and market your next game. The free ebook is available through CRC Press by clicking here. The Curated Books The Art of Game Design: A Book of Lenses, Second Edition, by Jesse Schell Presents 100+ sets of questions, or different lenses, for viewing a game’s design, encompassing diverse fields such as psychology, architecture, music, film, software engineering, theme park design, mathematics, anthropology, and more. Written by one of the world's top game designers, this book describes the deepest and most fundamental principles of game design, demonstrating how tactics used in board, card, and athletic games also work in video games. It provides practical instruction on creating world-class games that will be played again and again. View it here. A Practical Guide to Indie Game Marketing, by Joel Dreskin Marketing is an essential but too frequently overlooked or minimized component of the release plan for indie games. A Practical Guide to Indie Game Marketing provides you with the tools needed to build visibility and sell your indie games. With special focus on those developers with small budgets and limited staff and resources, this book is packed with tangible recommendations and techniques that you can put to use immediately. As a seasoned professional of the indie game arena, author Joel Dreskin gives you insight into practical, real-world experiences of marketing numerous successful games and also provides stories of the failures. View it here. An Architectural Approach to Level Design This is one of the first books to integrate architectural and spatial design theory with the field of level design. The book presents architectural techniques and theories for level designers to use in their own work. It connects architecture and level design in different ways that address the practical elements of how designers construct space and the experiential elements of how and why humans interact with this space. Throughout the text, readers learn skills for spatial layout, evoking emotion through gamespaces, and creating better levels through architectural theory. View it here. Learn more and download the ebook by clicking here. Did you know? GameDev.net and CRC Press also recently teamed up to bring GDNet+ Members up to a 20% discount on all CRC Press books. Learn more about this and other benefits here.
Sign in to follow this  
Followers 0
Kylotan

Seeking variable width line drawing algorithms

2 posts in this topic

I have a 2D array of values that map to coordinates, and a set of lines that pass through some of those coordinates. I want to be able to change the values in the array based on their proximity to these lines. So basically I need a line-drawing algorithm, but which supports arbitrary widths.

 

An algorithm like the Bresenham line-drawing algorithm would be fine if the line had essentially zero thickness, but the thickness varies from line to line and I'm not sure how I'd extend it to handle that.

 

I'm also aware that I could treat the line as a rectangle and fill that in, but it sounds suspiciously like implementing half of a software renderer which I'm not keen on doing, unless there is some very simple code or pseudocode that I can pretty much just drop in.

 

I currently have an interesting inverted solution, where I take each point in the array and calculate the distance from that point to the nearest line, and if that distance is less than the line's thickness, then the point is filled in. This has the beneficial effect of letting me taper off the values further from the line, giving me a nice gradient at the edges and avoiding aliasing as well. It also has the detrimental effect of being very slow, even with all the square roots removed from the distance calculations. There are too many redundant distance calculations against lines which turn out not to be the nearest one and thus not contributing to the final distance. But if I could speed this up I'd be happy to stick with it.

 

Any suggestions?

0

Share this post


Link to post
Share on other sites
Some sort of spatial data structure for the lines would speed up the search. A grid would probably do fine. And I hestitate to recommend it, but a BSP tree would be an elegant solution.
1

Share this post


Link to post
Share on other sites

Slightly hacky suggestion, but should be simple to implement and may be good enough depending on your precision/speed requirements:

 

You could use something like Bresenham but 'render' a square or circle at each point along the line instead of just a single pixel. For very thick lines you would be doing a lot of overdraw, so you could modify it to only stamp a square/circle once every n steps (where n depends on thickness). If you want to maintain your nice smooth gradients you could conceptually make your sphere more transparent at the edges, and blend with a max function.

Edited by C0lumbo
0

Share this post


Link to post
Share on other sites

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!


Register a new account

Sign in

Already have an account? Sign in here.


Sign In Now
Sign in to follow this  
Followers 0