Skip to main content

Questions tagged [graphics]

1 vote
1 answer
61 views

For a computer graphics class. Maybe I'm fundamentally misunderstanding something, but AFAIK the difference between implicit/explicit representations for modelling is just implicit uses equations and ...
Donut's user avatar
  • 11
0 votes
0 answers
59 views

I have been trying to find ways to display a 3d scene on a screen (specifically 480x240px Vex robotics brain). The only ways that I can draw to the screen is with drawing individual pixels or with ...
RBLX Reid's user avatar
4 votes
2 answers
711 views

I have computed a constrained triangulation of a set of points. The constraint happens to be a closed polygon. The objective is to detect all edges which are inside the polygon, that is, an edge where ...
Makogan's user avatar
  • 341
0 votes
0 answers
54 views

The code for degree elevation of curves in The NURBS Book by Les Piegl and Wayne Tiller pages 206--209(The_NURBS_Book) assumes the knot vector for the curve is given as: $$(0,...,0,...,1,...,1)$$ ...
John He's user avatar
0 votes
0 answers
100 views

The following post discussed how to convert(approximate) NURBS curve into cubic Bézier curve: Convert NURBS curve into Cubic Bezier Curve I am trying to come up with an algorithm that converts(...
John He's user avatar
0 votes
0 answers
66 views

This idea blows my mind, I would appreciate for any guidance. In essence, the question is how a machine should work to transform any kind of formal logic into its graphical representation (e.g. ...
Danila Nikolaychuk's user avatar
0 votes
1 answer
241 views

(15 marks) Suppose a ray comes from a point (2, 8) and hits at mirror point (6, 6). Assume that perpendicular vector a point (6, 6) is 𝑛̅= (0, 3). Find the reflection emitting point from (6, 6). [...
Kaleb's user avatar
  • 1
1 vote
0 answers
58 views

I have two non-convex polygon which intersect one another. I have written program years ago to find union polygons. I described that I has been used algorithm Weiler-Atherton. But in Wikipedia I found ...
Saku's user avatar
  • 141
2 votes
2 answers
667 views

This is a purely theoretical question: among the known flood fill algorithms, there is one which does not require any dynamically-sized data structures, explicit or implicit: the so-called Walk-based ...
Leo B.'s user avatar
  • 133
2 votes
0 answers
215 views

I need a layout algorithm and use it in the GUI, but I can't use existing GUI toolkits at the moment, so I would like to find a layout algorithm. I only need to do a single row layout, and here is the ...
skiars's user avatar
  • 21
1 vote
0 answers
157 views

I'm working on my bachelor thesis (on Computer Science) and right now I'm having a problem about finding shortest path between two points on 3D triangular mesh that is manifold. I already read about ...
Patrik Bašo's user avatar
0 votes
0 answers
37 views

In my computer graphics course I came across this "pro" for point clouds: Useful for large datasets (>> 1 point / pixel) I'm trying to wrap my head about it, I know drawing is ...
Oli's user avatar
  • 101
4 votes
1 answer
225 views

Common algorithms for creating bounding-volume-hierarchies (BVH) rely on grouping primitives together that are not necessarily adjacent in memory. This is either done by rearranging the primitives ...
thessalchips's user avatar
3 votes
0 answers
149 views

Say you have a grid of pixels. And there are 20 overlapping red rectangles on a blue background. I want to find an algorithm to count the minimum number of rectangles that are needed to form the image....
zooby's user avatar
  • 273

15 30 50 per page
1
2 3 4 5
9