Questions tagged [graphics]
The graphics tag has no summary.
130 questions
1
vote
1
answer
68
views
Why are polygon meshes explicit representations of a model when you're not explicitly storing most of the points?
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 ...
0
votes
0
answers
62
views
how to 3d render with only drawing pixels
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 ...
4
votes
2
answers
738
views
Detecting if an edge is "inside" a polygon?
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 ...
0
votes
0
answers
56
views
NURB Sphere surface degree elevation and knot insertion
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)$$
...
0
votes
0
answers
101
views
Convert NURBS surface into Cubic Bezier Surface
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(...
0
votes
0
answers
67
views
How to make a GUI for first-order logic representation?
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. ...
0
votes
1
answer
255
views
What is this question actually asking for me to solve?
(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).
[...
1
vote
0
answers
62
views
Polygon union with arcs
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 ...
2
votes
2
answers
710
views
Is there a working O(1)-space flood fill algorithm?
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 ...
2
votes
0
answers
221
views
A Single Row GUI Layout Algorithm
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 ...
1
vote
0
answers
158
views
Distance between two points on 3D Triangular Mesh Manifold
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 ...
0
votes
0
answers
38
views
Why are point clouds useful for large datasets of geometries?
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 ...
4
votes
1
answer
231
views
BVH construction without sorting
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 ...
3
votes
0
answers
150
views
Algorithm to count number of overlapping rectangles of the same colour?
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....