SubMiner/backlog/archive/tasks/task-20.3 - Implement-content-bounded-sizing-algorithm-for-visible-and-invisible-overlay-windows.md

id, title, status, assignee, created_date, updated_date, labels, dependencies, parent_task_id, priority

id	title	status	assignee	created_date	updated_date	labels	dependencies	parent_task_id	priority
TASK-20.3	Implement content-bounded sizing algorithm for visible and invisible overlay windows	To Do		2026-02-12 08:47	2026-02-12 09:42			TASK-20	medium

Description

Implement content-bounded sizing for visible/invisible windows using measured rects plus tracker origin, with robust clamping and jitter resistance.

Acceptance Criteria

• #1 Bounds algorithm applies configurable padding, minimum size, display-workarea clamp, and integer snap.
• #2 Main-process bounds updates are thresholded/debounced to reduce jitter and unnecessary setBounds churn.
• #3 When no valid measurement exists, layer falls back to safe tracker/display bounds without breaking interaction.
• #4 Visible+invisible overlays can coexist without full-window overlap/input conflicts caused by shared fullscreen bounds.