Pages that link to "Item:Q4291567"
From MaRDI portal
The following pages link to Computing and Verifying Depth Orders (Q4291567):
Displaying 12 items.
- Reasoning about visibility (Q420853) (← links)
- Perfect binary space partitions (Q676587) (← links)
- Efficient ray shooting and hidden surface removal (Q1330784) (← links)
- 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects (Q1370928) (← links)
- Almost tight bounds for eliminating depth cycles in three dimensions (Q1745206) (← links)
- New lower bounds for Hopcroft's problem (Q1816464) (← links)
- Computing depth orders for fat objects and related problems (Q1917032) (← links)
- Eliminating depth cycles among triangles in three dimensions (Q2207590) (← links)
- Removing depth-order cycles among triangles: an algorithm generating triangular fragments (Q2225657) (← links)
- Computing depth orders and related problems (Q5056161) (← links)
- Intractability of assembly sequencing: Unit disks in the plane (Q5096948) (← links)
- Computing Depths of Patterns (Q5404910) (← links)
