MyouProject/pixie
3
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

move toward more flexible trapezoid approach

Browse source
This commit is contained in:
Ryan Oldenburg 2022-06-28 22:06:19 -05:00
parent 47c285b4f4
commit 28a880b2b7
1 changed files with 13 additions and 15 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

28
src/pixie/paths.nim
View file

@ -1823,7 +1823,7 @@ proc fillHits(
proc fillShapes( proc fillShapes(
image: Image, image: Image,
shapes: seq[Polygon], shapes: var seq[Polygon],
color: SomeColor, color: SomeColor,
windingRule: WindingRule, windingRule: WindingRule,
blendMode: BlendMode blendMode: BlendMode
@ -1852,8 +1852,10 @@ proc fillShapes(
var var
partitions = partitionSegments(segments, startY, pathHeight - startY) partitions = partitionSegments(segments, startY, pathHeight - startY)
partitionIndex: int partitionIndex: int
entryIndices = newSeq[int](partitions.maxEntryCount)
numEntryIndices: int
coverages = newSeq[uint8](pathWidth) coverages = newSeq[uint8](pathWidth)
hits = newSeq[(Fixed32, int16)](partitions.maxEntryCount) hits = newSeq[(Fixed32, int16)](entryIndices.len)
numHits: int numHits: int
aa: bool aa: bool
@ -1895,13 +1897,13 @@ proc fillShapes(
y += partitionHeight y += partitionHeight
continue continue
var var allEntriesInScanlineSpanIt = true
allEntriesInScanlineSpanIt = true numEntryIndices = 0
tmp: int
entryIndices: array[2, int]
if partitions[partitionIndex].twoNonintersectingSpanningSegments: if partitions[partitionIndex].twoNonintersectingSpanningSegments:
tmp = 2 numEntryIndices = 2
entryIndices = [0, 1] entryIndices[0] = 0
entryIndices[1] = 1
else: else:
for i in 0 ..< partitions[partitionIndex].entries.len: for i in 0 ..< partitions[partitionIndex].entries.len:
if partitions[partitionIndex].entries[i].segment.to.y < y.float32 or if partitions[partitionIndex].entries[i].segment.to.y < y.float32 or
@ -1911,14 +1913,10 @@ proc fillShapes(
partitions[partitionIndex].entries[i].segment.to.y < (y + 1).float32: partitions[partitionIndex].entries[i].segment.to.y < (y + 1).float32:
allEntriesInScanlineSpanIt = false allEntriesInScanlineSpanIt = false
break break
if tmp < 2: entryIndices[numEntryIndices] = i
entryIndices[tmp] = i inc numEntryIndices
inc tmp
else:
tmp = 0
break
if allEntriesInScanlineSpanIt and tmp == 2: if allEntriesInScanlineSpanIt and numEntryIndices == 2:
var var
left = partitions[partitionIndex].entries[entryIndices[0]] left = partitions[partitionIndex].entries[entryIndices[0]]
right = partitions[partitionIndex].entries[entryIndices[1]] right = partitions[partitionIndex].entries[entryIndices[1]]